/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-Before.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-variant-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 05:44:36,555 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 05:44:36,557 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 05:44:36,622 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 05:44:36,622 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 05:44:36,623 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 05:44:36,623 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 05:44:36,624 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 05:44:36,626 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 05:44:36,626 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 05:44:36,627 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 05:44:36,627 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 05:44:36,628 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 05:44:36,628 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 05:44:36,631 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 05:44:36,635 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 05:44:36,635 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 05:44:36,639 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 05:44:36,642 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 05:44:36,646 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 05:44:36,647 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 05:44:36,649 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 05:44:36,650 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 05:44:36,650 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 05:44:36,653 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 05:44:36,653 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 05:44:36,654 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 05:44:36,655 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 05:44:36,655 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 05:44:36,656 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 05:44:36,656 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 05:44:36,656 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 05:44:36,657 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 05:44:36,658 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 05:44:36,659 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 05:44:36,659 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 05:44:36,659 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 05:44:36,659 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 05:44:36,659 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 05:44:36,660 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 05:44:36,660 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 05:44:36,661 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-Before.epf [2022-01-19 05:44:36,682 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 05:44:36,682 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 05:44:36,683 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 05:44:36,683 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 05:44:36,683 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 05:44:36,683 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 05:44:36,683 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 05:44:36,683 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 05:44:36,683 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 05:44:36,684 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 05:44:36,684 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 05:44:36,684 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 05:44:36,684 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 05:44:36,684 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 05:44:36,685 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 05:44:36,685 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 05:44:36,685 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 05:44:36,685 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 05:44:36,685 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 05:44:36,685 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 05:44:36,685 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 05:44:36,685 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 05:44:36,685 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 05:44:36,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 05:44:36,685 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 05:44:36,685 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 05:44:36,686 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 05:44:36,686 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 05:44:36,686 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 05:44:36,687 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 05:44:36,687 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 05:44:36,687 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 05:44:36,687 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 05:44:36,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 05:44:36,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 05:44:36,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 05:44:36,862 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 05:44:36,864 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 05:44:36,864 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-variant-2.i [2022-01-19 05:44:36,914 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f77c37d8f/c5ba61438a004b12b8f01430ee4f506b/FLAG1a20d11c2 [2022-01-19 05:44:37,335 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 05:44:37,336 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-variant-2.i [2022-01-19 05:44:37,350 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f77c37d8f/c5ba61438a004b12b8f01430ee4f506b/FLAG1a20d11c2 [2022-01-19 05:44:37,361 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f77c37d8f/c5ba61438a004b12b8f01430ee4f506b [2022-01-19 05:44:37,363 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 05:44:37,364 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 05:44:37,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 05:44:37,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 05:44:37,368 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 05:44:37,368 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 05:44:37" (1/1) ... [2022-01-19 05:44:37,369 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@319ca999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:44:37, skipping insertion in model container [2022-01-19 05:44:37,370 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 05:44:37" (1/1) ... [2022-01-19 05:44:37,374 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 05:44:37,403 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 05:44:37,594 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-variant-2.i[30035,30048] [2022-01-19 05:44:37,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 05:44:37,610 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 05:44:37,643 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-variant-2.i[30035,30048] [2022-01-19 05:44:37,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 05:44:37,685 INFO L208 MainTranslator]: Completed translation [2022-01-19 05:44:37,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:44:37 WrapperNode [2022-01-19 05:44:37,686 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 05:44:37,686 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 05:44:37,687 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 05:44:37,687 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 05:44:37,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:44:37" (1/1) ... [2022-01-19 05:44:37,712 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:44:37" (1/1) ... [2022-01-19 05:44:37,727 INFO L137 Inliner]: procedures = 171, calls = 26, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 80 [2022-01-19 05:44:37,727 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 05:44:37,728 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 05:44:37,728 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 05:44:37,728 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 05:44:37,732 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:44:37" (1/1) ... [2022-01-19 05:44:37,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:44:37" (1/1) ... [2022-01-19 05:44:37,734 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:44:37" (1/1) ... [2022-01-19 05:44:37,735 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:44:37" (1/1) ... [2022-01-19 05:44:37,738 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:44:37" (1/1) ... [2022-01-19 05:44:37,740 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:44:37" (1/1) ... [2022-01-19 05:44:37,741 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:44:37" (1/1) ... [2022-01-19 05:44:37,742 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 05:44:37,743 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 05:44:37,743 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 05:44:37,743 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 05:44:37,744 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:44:37" (1/1) ... [2022-01-19 05:44:37,751 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 05:44:37,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 05:44:37,770 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 05:44:37,775 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 05:44:37,796 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2022-01-19 05:44:37,797 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2022-01-19 05:44:37,797 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-01-19 05:44:37,797 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-01-19 05:44:37,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 05:44:37,797 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-01-19 05:44:37,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 05:44:37,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 05:44:37,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 05:44:37,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 05:44:37,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 05:44:37,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 05:44:37,798 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 05:44:37,875 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 05:44:37,877 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 05:44:38,069 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 05:44:38,074 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 05:44:38,074 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-19 05:44:38,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 05:44:38 BoogieIcfgContainer [2022-01-19 05:44:38,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 05:44:38,077 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 05:44:38,077 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 05:44:38,080 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 05:44:38,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 05:44:37" (1/3) ... [2022-01-19 05:44:38,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ff32d55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 05:44:38, skipping insertion in model container [2022-01-19 05:44:38,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:44:37" (2/3) ... [2022-01-19 05:44:38,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ff32d55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 05:44:38, skipping insertion in model container [2022-01-19 05:44:38,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 05:44:38" (3/3) ... [2022-01-19 05:44:38,083 INFO L111 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-variant-2.i [2022-01-19 05:44:38,088 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 05:44:38,089 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 05:44:38,089 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 05:44:38,137 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,138 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,138 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,138 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,138 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,138 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,138 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,138 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,139 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,139 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,139 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,139 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,141 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,141 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,143 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,143 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,143 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,143 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,144 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,144 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,145 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,145 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,145 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,145 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,145 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,146 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,146 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,146 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,146 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,146 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,147 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,147 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,147 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,148 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,148 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,148 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,149 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,150 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,150 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,150 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,150 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,150 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,151 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,151 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,151 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,151 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,152 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,152 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,152 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,152 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,152 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,152 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,153 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,153 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,153 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,153 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,153 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,154 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,154 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,154 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,154 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,154 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,157 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,157 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,157 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,157 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,157 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,158 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,158 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,158 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,158 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,158 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,162 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,162 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,163 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,163 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,163 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,163 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:38,164 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-19 05:44:38,207 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 05:44:38,221 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 05:44:38,222 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-01-19 05:44:38,232 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 99 places, 98 transitions, 206 flow [2022-01-19 05:44:38,286 INFO L129 PetriNetUnfolder]: 6/111 cut-off events. [2022-01-19 05:44:38,286 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 05:44:38,289 INFO L84 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 111 events. 6/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 136 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 73. Up to 4 conditions per place. [2022-01-19 05:44:38,289 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 98 transitions, 206 flow [2022-01-19 05:44:38,293 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 97 transitions, 202 flow [2022-01-19 05:44:38,311 INFO L129 PetriNetUnfolder]: 3/60 cut-off events. [2022-01-19 05:44:38,312 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 05:44:38,312 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:44:38,313 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] [2022-01-19 05:44:38,313 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 05:44:38,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:44:38,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1012560353, now seen corresponding path program 1 times [2022-01-19 05:44:38,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:44:38,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61731973] [2022-01-19 05:44:38,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:44:38,331 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:44:38,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:44:38,747 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 05:44:38,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:44:38,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61731973] [2022-01-19 05:44:38,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61731973] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:44:38,748 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:44:38,749 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 05:44:38,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195938914] [2022-01-19 05:44:38,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:44:38,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 05:44:38,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:44:38,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 05:44:38,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-01-19 05:44:38,783 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 98 [2022-01-19 05:44:38,786 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 97 transitions, 202 flow. Second operand has 9 states, 9 states have (on average 72.44444444444444) internal successors, (652), 9 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:38,786 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:44:38,786 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 98 [2022-01-19 05:44:38,787 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:44:39,037 INFO L129 PetriNetUnfolder]: 115/510 cut-off events. [2022-01-19 05:44:39,037 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-01-19 05:44:39,040 INFO L84 FinitePrefix]: Finished finitePrefix Result has 761 conditions, 510 events. 115/510 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2971 event pairs, 32 based on Foata normal form. 8/448 useless extension candidates. Maximal degree in co-relation 705. Up to 70 conditions per place. [2022-01-19 05:44:39,042 INFO L132 encePairwiseOnDemand]: 85/98 looper letters, 16 selfloop transitions, 5 changer transitions 33/121 dead transitions. [2022-01-19 05:44:39,042 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 121 transitions, 358 flow [2022-01-19 05:44:39,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 05:44:39,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 05:44:39,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 846 transitions. [2022-01-19 05:44:39,058 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7847866419294991 [2022-01-19 05:44:39,059 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 846 transitions. [2022-01-19 05:44:39,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 846 transitions. [2022-01-19 05:44:39,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:44:39,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 846 transitions. [2022-01-19 05:44:39,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 76.9090909090909) internal successors, (846), 11 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:39,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 98.0) internal successors, (1176), 12 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:39,073 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 98.0) internal successors, (1176), 12 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:39,074 INFO L186 Difference]: Start difference. First operand has 98 places, 97 transitions, 202 flow. Second operand 11 states and 846 transitions. [2022-01-19 05:44:39,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 121 transitions, 358 flow [2022-01-19 05:44:39,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 121 transitions, 357 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 05:44:39,081 INFO L242 Difference]: Finished difference. Result has 111 places, 86 transitions, 201 flow [2022-01-19 05:44:39,082 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=201, PETRI_PLACES=111, PETRI_TRANSITIONS=86} [2022-01-19 05:44:39,085 INFO L334 CegarLoopForPetriNet]: 98 programPoint places, 13 predicate places. [2022-01-19 05:44:39,085 INFO L470 AbstractCegarLoop]: Abstraction has has 111 places, 86 transitions, 201 flow [2022-01-19 05:44:39,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 72.44444444444444) internal successors, (652), 9 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:39,086 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:44:39,086 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] [2022-01-19 05:44:39,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 05:44:39,086 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 05:44:39,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:44:39,086 INFO L85 PathProgramCache]: Analyzing trace with hash 668142783, now seen corresponding path program 1 times [2022-01-19 05:44:39,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:44:39,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761950750] [2022-01-19 05:44:39,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:44:39,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:44:39,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:44:39,241 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 05:44:39,242 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:44:39,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761950750] [2022-01-19 05:44:39,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761950750] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:44:39,242 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:44:39,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 05:44:39,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602193733] [2022-01-19 05:44:39,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:44:39,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 05:44:39,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:44:39,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 05:44:39,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-01-19 05:44:39,246 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 98 [2022-01-19 05:44:39,247 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 86 transitions, 201 flow. Second operand has 9 states, 9 states have (on average 72.0) internal successors, (648), 9 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:39,247 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:44:39,247 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 98 [2022-01-19 05:44:39,247 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:44:39,379 INFO L129 PetriNetUnfolder]: 28/184 cut-off events. [2022-01-19 05:44:39,379 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-01-19 05:44:39,379 INFO L84 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 184 events. 28/184 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 480 event pairs, 1 based on Foata normal form. 5/178 useless extension candidates. Maximal degree in co-relation 297. Up to 18 conditions per place. [2022-01-19 05:44:39,381 INFO L132 encePairwiseOnDemand]: 87/98 looper letters, 0 selfloop transitions, 0 changer transitions 106/106 dead transitions. [2022-01-19 05:44:39,381 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 106 transitions, 324 flow [2022-01-19 05:44:39,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 05:44:39,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 05:44:39,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 883 transitions. [2022-01-19 05:44:39,382 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7508503401360545 [2022-01-19 05:44:39,382 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 883 transitions. [2022-01-19 05:44:39,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 883 transitions. [2022-01-19 05:44:39,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:44:39,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 883 transitions. [2022-01-19 05:44:39,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 73.58333333333333) internal successors, (883), 12 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:39,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 98.0) internal successors, (1274), 13 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:39,386 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 98.0) internal successors, (1274), 13 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:39,386 INFO L186 Difference]: Start difference. First operand has 111 places, 86 transitions, 201 flow. Second operand 12 states and 883 transitions. [2022-01-19 05:44:39,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 106 transitions, 324 flow [2022-01-19 05:44:39,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 106 transitions, 308 flow, removed 2 selfloop flow, removed 7 redundant places. [2022-01-19 05:44:39,390 INFO L242 Difference]: Finished difference. Result has 103 places, 0 transitions, 0 flow [2022-01-19 05:44:39,390 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=0, PETRI_PLACES=103, PETRI_TRANSITIONS=0} [2022-01-19 05:44:39,390 INFO L334 CegarLoopForPetriNet]: 98 programPoint places, 5 predicate places. [2022-01-19 05:44:39,390 INFO L470 AbstractCegarLoop]: Abstraction has has 103 places, 0 transitions, 0 flow [2022-01-19 05:44:39,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 72.0) internal successors, (648), 9 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:39,393 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-01-19 05:44:39,393 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-01-19 05:44:39,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 05:44:39,396 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-01-19 05:44:39,397 INFO L309 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE (1/2) [2022-01-19 05:44:39,407 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2022-01-19 05:44:39,411 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 05:44:39,411 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-01-19 05:44:39,413 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 99 places, 98 transitions, 206 flow [2022-01-19 05:44:39,422 INFO L129 PetriNetUnfolder]: 6/111 cut-off events. [2022-01-19 05:44:39,422 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 05:44:39,423 INFO L84 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 111 events. 6/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 136 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 73. Up to 4 conditions per place. [2022-01-19 05:44:39,423 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 98 transitions, 206 flow [2022-01-19 05:44:39,424 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 97 transitions, 202 flow [2022-01-19 05:44:39,431 INFO L129 PetriNetUnfolder]: 5/97 cut-off events. [2022-01-19 05:44:39,431 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 05:44:39,431 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:44:39,431 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:44:39,432 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-19 05:44:39,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:44:39,432 INFO L85 PathProgramCache]: Analyzing trace with hash -271182080, now seen corresponding path program 1 times [2022-01-19 05:44:39,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:44:39,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782507220] [2022-01-19 05:44:39,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:44:39,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:44:39,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 05:44:39,460 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 05:44:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 05:44:39,501 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 05:44:39,502 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 05:44:39,502 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 2 remaining) [2022-01-19 05:44:39,503 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 2 remaining) [2022-01-19 05:44:39,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 05:44:39,503 INFO L732 BasicCegarLoop]: Path program histogram: [1] [2022-01-19 05:44:39,503 INFO L309 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (2/2) [2022-01-19 05:44:39,504 WARN L235 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-01-19 05:44:39,504 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-01-19 05:44:39,520 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,520 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,520 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,520 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,521 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,521 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,521 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,521 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,521 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,521 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,521 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,521 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,522 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,522 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,525 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,525 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,525 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,525 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,525 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,525 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,525 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,526 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,526 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,526 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,526 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,526 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,526 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,526 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,526 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,526 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,526 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,527 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,530 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,530 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,530 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,530 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,530 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,530 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,530 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,530 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,531 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,531 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,533 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,533 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,533 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,533 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,533 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,533 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,533 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,533 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,533 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,533 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,534 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,534 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,534 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,534 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,534 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,534 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,535 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,535 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,535 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,535 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,535 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,535 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,535 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,535 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,535 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,535 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,536 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,536 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,536 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,536 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,536 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,537 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,537 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,537 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,537 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,537 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,537 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,537 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,537 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,537 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,538 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,538 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,539 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,539 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,539 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,539 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,539 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,539 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,539 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,539 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,539 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,540 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,540 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,540 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,541 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,541 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,541 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,541 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,541 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,541 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,541 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,541 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,542 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,542 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,542 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,542 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,542 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,542 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,543 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,543 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,543 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,543 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,543 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,543 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,544 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,544 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,545 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,547 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,548 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,548 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,548 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,548 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,548 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,549 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,549 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,549 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,549 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,549 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,549 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,549 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,549 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,549 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,550 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,550 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,550 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,550 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,550 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,550 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,550 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,550 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,551 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,551 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,551 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,551 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,551 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,551 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,551 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,551 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,552 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,552 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,552 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,552 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,552 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,552 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:39,553 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-19 05:44:39,554 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 05:44:39,555 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 05:44:39,556 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-19 05:44:39,558 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 134 places, 132 transitions, 288 flow [2022-01-19 05:44:39,574 INFO L129 PetriNetUnfolder]: 9/151 cut-off events. [2022-01-19 05:44:39,574 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 05:44:39,575 INFO L84 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 151 events. 9/151 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 236 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 160. Up to 6 conditions per place. [2022-01-19 05:44:39,575 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 132 transitions, 288 flow [2022-01-19 05:44:39,577 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 118 transitions, 251 flow [2022-01-19 05:44:39,581 INFO L129 PetriNetUnfolder]: 2/61 cut-off events. [2022-01-19 05:44:39,581 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 05:44:39,581 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:44:39,581 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] [2022-01-19 05:44:39,581 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 05:44:39,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:44:39,582 INFO L85 PathProgramCache]: Analyzing trace with hash -2078155084, now seen corresponding path program 1 times [2022-01-19 05:44:39,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:44:39,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931078698] [2022-01-19 05:44:39,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:44:39,582 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:44:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:44:39,750 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 05:44:39,751 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:44:39,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931078698] [2022-01-19 05:44:39,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931078698] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:44:39,751 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:44:39,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 05:44:39,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937813854] [2022-01-19 05:44:39,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:44:39,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 05:44:39,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:44:39,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 05:44:39,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-01-19 05:44:39,753 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 132 [2022-01-19 05:44:39,754 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 118 transitions, 251 flow. Second operand has 9 states, 9 states have (on average 96.44444444444444) internal successors, (868), 9 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:39,754 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:44:39,754 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 132 [2022-01-19 05:44:39,754 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:44:40,094 INFO L129 PetriNetUnfolder]: 1075/2289 cut-off events. [2022-01-19 05:44:40,094 INFO L130 PetriNetUnfolder]: For 100/100 co-relation queries the response was YES. [2022-01-19 05:44:40,098 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4043 conditions, 2289 events. 1075/2289 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 17504 event pairs, 66 based on Foata normal form. 180/1970 useless extension candidates. Maximal degree in co-relation 3986. Up to 382 conditions per place. [2022-01-19 05:44:40,102 INFO L132 encePairwiseOnDemand]: 117/132 looper letters, 30 selfloop transitions, 6 changer transitions 68/187 dead transitions. [2022-01-19 05:44:40,102 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 187 transitions, 629 flow [2022-01-19 05:44:40,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 05:44:40,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 05:44:40,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1172 transitions. [2022-01-19 05:44:40,105 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8071625344352618 [2022-01-19 05:44:40,105 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1172 transitions. [2022-01-19 05:44:40,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1172 transitions. [2022-01-19 05:44:40,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:44:40,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1172 transitions. [2022-01-19 05:44:40,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 106.54545454545455) internal successors, (1172), 11 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:40,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 132.0) internal successors, (1584), 12 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:40,109 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 132.0) internal successors, (1584), 12 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:40,109 INFO L186 Difference]: Start difference. First operand has 119 places, 118 transitions, 251 flow. Second operand 11 states and 1172 transitions. [2022-01-19 05:44:40,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 187 transitions, 629 flow [2022-01-19 05:44:40,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 187 transitions, 626 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-01-19 05:44:40,114 INFO L242 Difference]: Finished difference. Result has 132 places, 110 transitions, 269 flow [2022-01-19 05:44:40,114 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=269, PETRI_PLACES=132, PETRI_TRANSITIONS=110} [2022-01-19 05:44:40,115 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 13 predicate places. [2022-01-19 05:44:40,116 INFO L470 AbstractCegarLoop]: Abstraction has has 132 places, 110 transitions, 269 flow [2022-01-19 05:44:40,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 96.44444444444444) internal successors, (868), 9 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:40,116 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:44:40,116 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] [2022-01-19 05:44:40,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 05:44:40,117 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 05:44:40,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:44:40,119 INFO L85 PathProgramCache]: Analyzing trace with hash 125554756, now seen corresponding path program 1 times [2022-01-19 05:44:40,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:44:40,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339586097] [2022-01-19 05:44:40,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:44:40,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:44:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:44:40,217 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 05:44:40,217 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:44:40,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339586097] [2022-01-19 05:44:40,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339586097] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:44:40,218 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:44:40,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 05:44:40,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160464324] [2022-01-19 05:44:40,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:44:40,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 05:44:40,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:44:40,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 05:44:40,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-01-19 05:44:40,220 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 132 [2022-01-19 05:44:40,221 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 110 transitions, 269 flow. Second operand has 9 states, 9 states have (on average 96.0) internal successors, (864), 9 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:40,221 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:44:40,221 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 132 [2022-01-19 05:44:40,221 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:44:40,480 INFO L129 PetriNetUnfolder]: 683/1651 cut-off events. [2022-01-19 05:44:40,480 INFO L130 PetriNetUnfolder]: For 490/490 co-relation queries the response was YES. [2022-01-19 05:44:40,485 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3468 conditions, 1651 events. 683/1651 cut-off events. For 490/490 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11152 event pairs, 85 based on Foata normal form. 30/1450 useless extension candidates. Maximal degree in co-relation 3406. Up to 336 conditions per place. [2022-01-19 05:44:40,490 INFO L132 encePairwiseOnDemand]: 120/132 looper letters, 60 selfloop transitions, 15 changer transitions 35/191 dead transitions. [2022-01-19 05:44:40,490 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 191 transitions, 723 flow [2022-01-19 05:44:40,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-19 05:44:40,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-19 05:44:40,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1522 transitions. [2022-01-19 05:44:40,493 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7686868686868686 [2022-01-19 05:44:40,493 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1522 transitions. [2022-01-19 05:44:40,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1522 transitions. [2022-01-19 05:44:40,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:44:40,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1522 transitions. [2022-01-19 05:44:40,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 101.46666666666667) internal successors, (1522), 15 states have internal predecessors, (1522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:40,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 132.0) internal successors, (2112), 16 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:40,498 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 132.0) internal successors, (2112), 16 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:40,498 INFO L186 Difference]: Start difference. First operand has 132 places, 110 transitions, 269 flow. Second operand 15 states and 1522 transitions. [2022-01-19 05:44:40,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 191 transitions, 723 flow [2022-01-19 05:44:40,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 191 transitions, 690 flow, removed 11 selfloop flow, removed 6 redundant places. [2022-01-19 05:44:40,505 INFO L242 Difference]: Finished difference. Result has 140 places, 117 transitions, 343 flow [2022-01-19 05:44:40,505 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=343, PETRI_PLACES=140, PETRI_TRANSITIONS=117} [2022-01-19 05:44:40,505 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 21 predicate places. [2022-01-19 05:44:40,505 INFO L470 AbstractCegarLoop]: Abstraction has has 140 places, 117 transitions, 343 flow [2022-01-19 05:44:40,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 96.0) internal successors, (864), 9 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:40,506 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:44:40,506 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:44:40,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 05:44:40,506 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 05:44:40,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:44:40,507 INFO L85 PathProgramCache]: Analyzing trace with hash 140803306, now seen corresponding path program 1 times [2022-01-19 05:44:40,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:44:40,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392233730] [2022-01-19 05:44:40,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:44:40,507 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:44:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:44:40,583 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:44:40,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:44:40,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392233730] [2022-01-19 05:44:40,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392233730] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 05:44:40,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563632067] [2022-01-19 05:44:40,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:44:40,584 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:44:40,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 05:44:40,586 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 05:44:40,616 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 05:44:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:44:40,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-19 05:44:40,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 05:44:40,960 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:44:40,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 05:44:41,117 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:44:41,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563632067] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 05:44:41,117 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 05:44:41,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 25 [2022-01-19 05:44:41,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960332953] [2022-01-19 05:44:41,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 05:44:41,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-19 05:44:41,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:44:41,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-19 05:44:41,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2022-01-19 05:44:41,120 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 132 [2022-01-19 05:44:41,122 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 117 transitions, 343 flow. Second operand has 25 states, 25 states have (on average 95.4) internal successors, (2385), 25 states have internal predecessors, (2385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:41,122 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:44:41,122 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 132 [2022-01-19 05:44:41,122 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:44:41,828 INFO L129 PetriNetUnfolder]: 566/1580 cut-off events. [2022-01-19 05:44:41,828 INFO L130 PetriNetUnfolder]: For 1534/1542 co-relation queries the response was YES. [2022-01-19 05:44:41,832 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3693 conditions, 1580 events. 566/1580 cut-off events. For 1534/1542 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10717 event pairs, 15 based on Foata normal form. 65/1539 useless extension candidates. Maximal degree in co-relation 3624. Up to 175 conditions per place. [2022-01-19 05:44:41,835 INFO L132 encePairwiseOnDemand]: 117/132 looper letters, 58 selfloop transitions, 28 changer transitions 90/256 dead transitions. [2022-01-19 05:44:41,835 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 256 transitions, 1260 flow [2022-01-19 05:44:41,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-19 05:44:41,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-01-19 05:44:41,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2496 transitions. [2022-01-19 05:44:41,839 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7563636363636363 [2022-01-19 05:44:41,839 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 2496 transitions. [2022-01-19 05:44:41,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 2496 transitions. [2022-01-19 05:44:41,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:44:41,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 2496 transitions. [2022-01-19 05:44:41,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 99.84) internal successors, (2496), 25 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:41,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 132.0) internal successors, (3432), 26 states have internal predecessors, (3432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:41,847 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 132.0) internal successors, (3432), 26 states have internal predecessors, (3432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:41,847 INFO L186 Difference]: Start difference. First operand has 140 places, 117 transitions, 343 flow. Second operand 25 states and 2496 transitions. [2022-01-19 05:44:41,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 256 transitions, 1260 flow [2022-01-19 05:44:41,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 256 transitions, 1177 flow, removed 32 selfloop flow, removed 7 redundant places. [2022-01-19 05:44:41,856 INFO L242 Difference]: Finished difference. Result has 166 places, 133 transitions, 475 flow [2022-01-19 05:44:41,857 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=475, PETRI_PLACES=166, PETRI_TRANSITIONS=133} [2022-01-19 05:44:41,857 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 47 predicate places. [2022-01-19 05:44:41,857 INFO L470 AbstractCegarLoop]: Abstraction has has 166 places, 133 transitions, 475 flow [2022-01-19 05:44:41,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 95.4) internal successors, (2385), 25 states have internal predecessors, (2385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:41,858 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:44:41,858 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:44:41,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-19 05:44:42,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-01-19 05:44:42,072 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 05:44:42,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:44:42,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1365710587, now seen corresponding path program 1 times [2022-01-19 05:44:42,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:44:42,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604193335] [2022-01-19 05:44:42,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:44:42,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:44:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:44:42,127 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:44:42,127 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:44:42,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604193335] [2022-01-19 05:44:42,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604193335] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:44:42,127 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:44:42,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 05:44:42,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860118296] [2022-01-19 05:44:42,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:44:42,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 05:44:42,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:44:42,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 05:44:42,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 05:44:42,130 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 132 [2022-01-19 05:44:42,131 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 133 transitions, 475 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:42,131 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:44:42,131 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 132 [2022-01-19 05:44:42,131 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:44:42,166 INFO L129 PetriNetUnfolder]: 24/317 cut-off events. [2022-01-19 05:44:42,166 INFO L130 PetriNetUnfolder]: For 337/337 co-relation queries the response was YES. [2022-01-19 05:44:42,167 INFO L84 FinitePrefix]: Finished finitePrefix Result has 659 conditions, 317 events. 24/317 cut-off events. For 337/337 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1059 event pairs, 7 based on Foata normal form. 2/309 useless extension candidates. Maximal degree in co-relation 581. Up to 28 conditions per place. [2022-01-19 05:44:42,168 INFO L132 encePairwiseOnDemand]: 128/132 looper letters, 10 selfloop transitions, 4 changer transitions 0/134 dead transitions. [2022-01-19 05:44:42,168 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 134 transitions, 510 flow [2022-01-19 05:44:42,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 05:44:42,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 05:44:42,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2022-01-19 05:44:42,169 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8737373737373737 [2022-01-19 05:44:42,169 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 346 transitions. [2022-01-19 05:44:42,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions. [2022-01-19 05:44:42,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:44:42,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions. [2022-01-19 05:44:42,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:42,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:42,171 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:42,171 INFO L186 Difference]: Start difference. First operand has 166 places, 133 transitions, 475 flow. Second operand 3 states and 346 transitions. [2022-01-19 05:44:42,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 134 transitions, 510 flow [2022-01-19 05:44:42,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 134 transitions, 467 flow, removed 16 selfloop flow, removed 13 redundant places. [2022-01-19 05:44:42,174 INFO L242 Difference]: Finished difference. Result has 146 places, 133 transitions, 440 flow [2022-01-19 05:44:42,175 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=440, PETRI_PLACES=146, PETRI_TRANSITIONS=133} [2022-01-19 05:44:42,176 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 27 predicate places. [2022-01-19 05:44:42,176 INFO L470 AbstractCegarLoop]: Abstraction has has 146 places, 133 transitions, 440 flow [2022-01-19 05:44:42,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:42,176 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:44:42,176 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:44:42,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 05:44:42,176 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 05:44:42,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:44:42,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1875355123, now seen corresponding path program 1 times [2022-01-19 05:44:42,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:44:42,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839145926] [2022-01-19 05:44:42,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:44:42,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:44:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:44:42,310 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:44:42,310 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:44:42,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839145926] [2022-01-19 05:44:42,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839145926] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 05:44:42,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054576440] [2022-01-19 05:44:42,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:44:42,311 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:44:42,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 05:44:42,312 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 05:44:42,313 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 05:44:42,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:44:42,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-19 05:44:42,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 05:44:42,693 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:44:42,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 05:44:42,890 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:44:42,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054576440] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 05:44:42,891 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 05:44:42,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 29 [2022-01-19 05:44:42,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140773001] [2022-01-19 05:44:42,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 05:44:42,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-19 05:44:42,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:44:42,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-19 05:44:42,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=706, Unknown=0, NotChecked=0, Total=812 [2022-01-19 05:44:42,894 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 132 [2022-01-19 05:44:42,895 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 133 transitions, 440 flow. Second operand has 29 states, 29 states have (on average 94.17241379310344) internal successors, (2731), 29 states have internal predecessors, (2731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:42,896 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:44:42,896 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 132 [2022-01-19 05:44:42,896 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:44:43,783 INFO L129 PetriNetUnfolder]: 306/1192 cut-off events. [2022-01-19 05:44:43,784 INFO L130 PetriNetUnfolder]: For 1056/1085 co-relation queries the response was YES. [2022-01-19 05:44:43,787 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2845 conditions, 1192 events. 306/1192 cut-off events. For 1056/1085 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 7747 event pairs, 14 based on Foata normal form. 18/1187 useless extension candidates. Maximal degree in co-relation 2779. Up to 118 conditions per place. [2022-01-19 05:44:43,790 INFO L132 encePairwiseOnDemand]: 116/132 looper letters, 67 selfloop transitions, 28 changer transitions 86/260 dead transitions. [2022-01-19 05:44:43,790 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 260 transitions, 1398 flow [2022-01-19 05:44:43,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-01-19 05:44:43,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-01-19 05:44:43,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 3493 transitions. [2022-01-19 05:44:43,796 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7350589225589226 [2022-01-19 05:44:43,796 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 3493 transitions. [2022-01-19 05:44:43,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 3493 transitions. [2022-01-19 05:44:43,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:44:43,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 3493 transitions. [2022-01-19 05:44:43,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 97.02777777777777) internal successors, (3493), 36 states have internal predecessors, (3493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:43,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 132.0) internal successors, (4884), 37 states have internal predecessors, (4884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:43,807 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 132.0) internal successors, (4884), 37 states have internal predecessors, (4884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:43,807 INFO L186 Difference]: Start difference. First operand has 146 places, 133 transitions, 440 flow. Second operand 36 states and 3493 transitions. [2022-01-19 05:44:43,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 260 transitions, 1398 flow [2022-01-19 05:44:43,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 260 transitions, 1394 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 05:44:43,813 INFO L242 Difference]: Finished difference. Result has 201 places, 135 transitions, 595 flow [2022-01-19 05:44:43,813 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=595, PETRI_PLACES=201, PETRI_TRANSITIONS=135} [2022-01-19 05:44:43,814 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 82 predicate places. [2022-01-19 05:44:43,814 INFO L470 AbstractCegarLoop]: Abstraction has has 201 places, 135 transitions, 595 flow [2022-01-19 05:44:43,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 94.17241379310344) internal successors, (2731), 29 states have internal predecessors, (2731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:43,815 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:44:43,815 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:44:43,833 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 05:44:44,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-01-19 05:44:44,034 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 05:44:44,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:44:44,034 INFO L85 PathProgramCache]: Analyzing trace with hash -966973721, now seen corresponding path program 2 times [2022-01-19 05:44:44,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:44:44,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010944238] [2022-01-19 05:44:44,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:44:44,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:44:44,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:44:44,145 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:44:44,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:44:44,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010944238] [2022-01-19 05:44:44,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010944238] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 05:44:44,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123673392] [2022-01-19 05:44:44,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 05:44:44,145 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:44:44,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 05:44:44,146 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 05:44:44,147 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 05:44:44,218 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 05:44:44,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 05:44:44,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-19 05:44:44,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 05:44:44,561 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:44:44,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 05:44:44,746 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:44:44,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123673392] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 05:44:44,747 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 05:44:44,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 29 [2022-01-19 05:44:44,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73438886] [2022-01-19 05:44:44,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 05:44:44,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-19 05:44:44,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:44:44,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-19 05:44:44,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=719, Unknown=0, NotChecked=0, Total=812 [2022-01-19 05:44:44,749 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 132 [2022-01-19 05:44:44,751 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 135 transitions, 595 flow. Second operand has 29 states, 29 states have (on average 94.24137931034483) internal successors, (2733), 29 states have internal predecessors, (2733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:44,751 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:44:44,751 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 132 [2022-01-19 05:44:44,751 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:44:46,155 INFO L129 PetriNetUnfolder]: 341/1494 cut-off events. [2022-01-19 05:44:46,156 INFO L130 PetriNetUnfolder]: For 8304/8436 co-relation queries the response was YES. [2022-01-19 05:44:46,162 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5136 conditions, 1494 events. 341/1494 cut-off events. For 8304/8436 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 10571 event pairs, 18 based on Foata normal form. 31/1492 useless extension candidates. Maximal degree in co-relation 5045. Up to 175 conditions per place. [2022-01-19 05:44:46,166 INFO L132 encePairwiseOnDemand]: 116/132 looper letters, 65 selfloop transitions, 28 changer transitions 163/335 dead transitions. [2022-01-19 05:44:46,166 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 335 transitions, 3168 flow [2022-01-19 05:44:46,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-01-19 05:44:46,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2022-01-19 05:44:46,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 5872 transitions. [2022-01-19 05:44:46,174 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7292598112270243 [2022-01-19 05:44:46,174 INFO L72 ComplementDD]: Start complementDD. Operand 61 states and 5872 transitions. [2022-01-19 05:44:46,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 5872 transitions. [2022-01-19 05:44:46,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:44:46,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 61 states and 5872 transitions. [2022-01-19 05:44:46,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 62 states, 61 states have (on average 96.26229508196721) internal successors, (5872), 61 states have internal predecessors, (5872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:46,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 62 states, 62 states have (on average 132.0) internal successors, (8184), 62 states have internal predecessors, (8184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:46,198 INFO L81 ComplementDD]: Finished complementDD. Result has 62 states, 62 states have (on average 132.0) internal successors, (8184), 62 states have internal predecessors, (8184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:46,199 INFO L186 Difference]: Start difference. First operand has 201 places, 135 transitions, 595 flow. Second operand 61 states and 5872 transitions. [2022-01-19 05:44:46,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 335 transitions, 3168 flow [2022-01-19 05:44:46,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 335 transitions, 2490 flow, removed 308 selfloop flow, removed 25 redundant places. [2022-01-19 05:44:46,215 INFO L242 Difference]: Finished difference. Result has 257 places, 134 transitions, 705 flow [2022-01-19 05:44:46,216 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=61, PETRI_FLOW=705, PETRI_PLACES=257, PETRI_TRANSITIONS=134} [2022-01-19 05:44:46,218 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 138 predicate places. [2022-01-19 05:44:46,218 INFO L470 AbstractCegarLoop]: Abstraction has has 257 places, 134 transitions, 705 flow [2022-01-19 05:44:46,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 94.24137931034483) internal successors, (2733), 29 states have internal predecessors, (2733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:46,219 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:44:46,219 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:44:46,236 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 05:44:46,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:44:46,423 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 05:44:46,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:44:46,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1245719071, now seen corresponding path program 1 times [2022-01-19 05:44:46,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:44:46,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336527868] [2022-01-19 05:44:46,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:44:46,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:44:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:44:46,539 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:44:46,539 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:44:46,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336527868] [2022-01-19 05:44:46,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336527868] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 05:44:46,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470193111] [2022-01-19 05:44:46,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:44:46,540 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:44:46,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 05:44:46,541 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 05:44:46,542 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 05:44:46,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:44:46,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-19 05:44:46,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 05:44:46,899 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:44:46,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 05:44:47,057 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:44:47,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470193111] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 05:44:47,057 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 05:44:47,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 29 [2022-01-19 05:44:47,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919160176] [2022-01-19 05:44:47,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 05:44:47,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-19 05:44:47,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:44:47,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-19 05:44:47,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=706, Unknown=0, NotChecked=0, Total=812 [2022-01-19 05:44:47,060 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 132 [2022-01-19 05:44:47,061 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 134 transitions, 705 flow. Second operand has 29 states, 29 states have (on average 94.24137931034483) internal successors, (2733), 29 states have internal predecessors, (2733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:47,062 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:44:47,062 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 132 [2022-01-19 05:44:47,062 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:44:47,909 INFO L129 PetriNetUnfolder]: 216/954 cut-off events. [2022-01-19 05:44:47,909 INFO L130 PetriNetUnfolder]: For 15874/15989 co-relation queries the response was YES. [2022-01-19 05:44:47,916 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4089 conditions, 954 events. 216/954 cut-off events. For 15874/15989 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 5512 event pairs, 20 based on Foata normal form. 16/949 useless extension candidates. Maximal degree in co-relation 3970. Up to 83 conditions per place. [2022-01-19 05:44:47,918 INFO L132 encePairwiseOnDemand]: 116/132 looper letters, 39 selfloop transitions, 23 changer transitions 104/244 dead transitions. [2022-01-19 05:44:47,919 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 244 transitions, 2510 flow [2022-01-19 05:44:47,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-01-19 05:44:47,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2022-01-19 05:44:47,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 3844 transitions. [2022-01-19 05:44:47,922 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.728030303030303 [2022-01-19 05:44:47,923 INFO L72 ComplementDD]: Start complementDD. Operand 40 states and 3844 transitions. [2022-01-19 05:44:47,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 3844 transitions. [2022-01-19 05:44:47,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:44:47,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 3844 transitions. [2022-01-19 05:44:47,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 41 states, 40 states have (on average 96.1) internal successors, (3844), 40 states have internal predecessors, (3844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:47,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 41 states, 41 states have (on average 132.0) internal successors, (5412), 41 states have internal predecessors, (5412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:47,933 INFO L81 ComplementDD]: Finished complementDD. Result has 41 states, 41 states have (on average 132.0) internal successors, (5412), 41 states have internal predecessors, (5412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:47,933 INFO L186 Difference]: Start difference. First operand has 257 places, 134 transitions, 705 flow. Second operand 40 states and 3844 transitions. [2022-01-19 05:44:47,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 244 transitions, 2510 flow [2022-01-19 05:44:47,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 244 transitions, 1592 flow, removed 411 selfloop flow, removed 57 redundant places. [2022-01-19 05:44:47,998 INFO L242 Difference]: Finished difference. Result has 207 places, 121 transitions, 514 flow [2022-01-19 05:44:47,998 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=514, PETRI_PLACES=207, PETRI_TRANSITIONS=121} [2022-01-19 05:44:47,998 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 88 predicate places. [2022-01-19 05:44:47,999 INFO L470 AbstractCegarLoop]: Abstraction has has 207 places, 121 transitions, 514 flow [2022-01-19 05:44:47,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 94.24137931034483) internal successors, (2733), 29 states have internal predecessors, (2733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:47,999 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:44:47,999 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:44:48,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-19 05:44:48,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:44:48,207 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 05:44:48,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:44:48,208 INFO L85 PathProgramCache]: Analyzing trace with hash 2135621275, now seen corresponding path program 3 times [2022-01-19 05:44:48,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:44:48,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733319767] [2022-01-19 05:44:48,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:44:48,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:44:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:44:48,315 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:44:48,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:44:48,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733319767] [2022-01-19 05:44:48,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733319767] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 05:44:48,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978759998] [2022-01-19 05:44:48,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 05:44:48,315 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:44:48,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 05:44:48,316 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 05:44:48,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-19 05:44:48,386 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-19 05:44:48,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 05:44:48,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-19 05:44:48,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 05:44:48,694 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:44:48,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 05:44:48,870 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:44:48,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978759998] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 05:44:48,870 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 05:44:48,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 29 [2022-01-19 05:44:48,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276256666] [2022-01-19 05:44:48,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 05:44:48,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-19 05:44:48,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:44:48,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-19 05:44:48,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2022-01-19 05:44:48,872 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 132 [2022-01-19 05:44:48,873 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 121 transitions, 514 flow. Second operand has 29 states, 29 states have (on average 94.24137931034483) internal successors, (2733), 29 states have internal predecessors, (2733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:48,874 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:44:48,874 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 132 [2022-01-19 05:44:48,874 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:44:50,009 INFO L129 PetriNetUnfolder]: 240/1241 cut-off events. [2022-01-19 05:44:50,009 INFO L130 PetriNetUnfolder]: For 7111/7179 co-relation queries the response was YES. [2022-01-19 05:44:50,014 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4201 conditions, 1241 events. 240/1241 cut-off events. For 7111/7179 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 8671 event pairs, 51 based on Foata normal form. 20/1231 useless extension candidates. Maximal degree in co-relation 4111. Up to 162 conditions per place. [2022-01-19 05:44:50,017 INFO L132 encePairwiseOnDemand]: 116/132 looper letters, 60 selfloop transitions, 30 changer transitions 121/289 dead transitions. [2022-01-19 05:44:50,017 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 289 transitions, 2733 flow [2022-01-19 05:44:50,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-01-19 05:44:50,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2022-01-19 05:44:50,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 5086 transitions. [2022-01-19 05:44:50,022 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.726986849628359 [2022-01-19 05:44:50,022 INFO L72 ComplementDD]: Start complementDD. Operand 53 states and 5086 transitions. [2022-01-19 05:44:50,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 5086 transitions. [2022-01-19 05:44:50,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:44:50,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 53 states and 5086 transitions. [2022-01-19 05:44:50,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 54 states, 53 states have (on average 95.9622641509434) internal successors, (5086), 53 states have internal predecessors, (5086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:50,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 54 states, 54 states have (on average 132.0) internal successors, (7128), 54 states have internal predecessors, (7128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:50,037 INFO L81 ComplementDD]: Finished complementDD. Result has 54 states, 54 states have (on average 132.0) internal successors, (7128), 54 states have internal predecessors, (7128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:50,038 INFO L186 Difference]: Start difference. First operand has 207 places, 121 transitions, 514 flow. Second operand 53 states and 5086 transitions. [2022-01-19 05:44:50,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 289 transitions, 2733 flow [2022-01-19 05:44:50,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 289 transitions, 2150 flow, removed 247 selfloop flow, removed 31 redundant places. [2022-01-19 05:44:50,052 INFO L242 Difference]: Finished difference. Result has 225 places, 133 transitions, 681 flow [2022-01-19 05:44:50,053 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=681, PETRI_PLACES=225, PETRI_TRANSITIONS=133} [2022-01-19 05:44:50,054 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 106 predicate places. [2022-01-19 05:44:50,054 INFO L470 AbstractCegarLoop]: Abstraction has has 225 places, 133 transitions, 681 flow [2022-01-19 05:44:50,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 94.24137931034483) internal successors, (2733), 29 states have internal predecessors, (2733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:50,054 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:44:50,054 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:44:50,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-01-19 05:44:50,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-01-19 05:44:50,267 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 05:44:50,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:44:50,268 INFO L85 PathProgramCache]: Analyzing trace with hash 2104112781, now seen corresponding path program 4 times [2022-01-19 05:44:50,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:44:50,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252048932] [2022-01-19 05:44:50,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:44:50,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:44:50,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:44:50,355 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:44:50,355 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:44:50,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252048932] [2022-01-19 05:44:50,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252048932] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 05:44:50,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319877055] [2022-01-19 05:44:50,355 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-19 05:44:50,356 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:44:50,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 05:44:50,357 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 05:44:50,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-19 05:44:50,431 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-19 05:44:50,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 05:44:50,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-19 05:44:50,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 05:44:50,760 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:44:50,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 05:44:50,917 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 05:44:50,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319877055] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 05:44:50,917 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 05:44:50,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 27 [2022-01-19 05:44:50,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485287058] [2022-01-19 05:44:50,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 05:44:50,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 05:44:50,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:44:50,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 05:44:50,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2022-01-19 05:44:50,919 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 132 [2022-01-19 05:44:50,921 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 133 transitions, 681 flow. Second operand has 27 states, 27 states have (on average 94.25925925925925) internal successors, (2545), 27 states have internal predecessors, (2545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:50,921 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:44:50,921 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 132 [2022-01-19 05:44:50,921 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:44:51,432 INFO L129 PetriNetUnfolder]: 118/647 cut-off events. [2022-01-19 05:44:51,433 INFO L130 PetriNetUnfolder]: For 4212/4258 co-relation queries the response was YES. [2022-01-19 05:44:51,436 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2340 conditions, 647 events. 118/647 cut-off events. For 4212/4258 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3298 event pairs, 39 based on Foata normal form. 11/644 useless extension candidates. Maximal degree in co-relation 2244. Up to 122 conditions per place. [2022-01-19 05:44:51,438 INFO L132 encePairwiseOnDemand]: 116/132 looper letters, 35 selfloop transitions, 17 changer transitions 51/181 dead transitions. [2022-01-19 05:44:51,438 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 181 transitions, 1456 flow [2022-01-19 05:44:51,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-19 05:44:51,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-01-19 05:44:51,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2401 transitions. [2022-01-19 05:44:51,441 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7275757575757575 [2022-01-19 05:44:51,441 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 2401 transitions. [2022-01-19 05:44:51,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 2401 transitions. [2022-01-19 05:44:51,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:44:51,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 2401 transitions. [2022-01-19 05:44:51,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 96.04) internal successors, (2401), 25 states have internal predecessors, (2401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:51,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 132.0) internal successors, (3432), 26 states have internal predecessors, (3432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:51,446 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 132.0) internal successors, (3432), 26 states have internal predecessors, (3432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:51,447 INFO L186 Difference]: Start difference. First operand has 225 places, 133 transitions, 681 flow. Second operand 25 states and 2401 transitions. [2022-01-19 05:44:51,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 181 transitions, 1456 flow [2022-01-19 05:44:51,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 181 transitions, 1135 flow, removed 149 selfloop flow, removed 35 redundant places. [2022-01-19 05:44:51,457 INFO L242 Difference]: Finished difference. Result has 188 places, 119 transitions, 484 flow [2022-01-19 05:44:51,457 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=484, PETRI_PLACES=188, PETRI_TRANSITIONS=119} [2022-01-19 05:44:51,458 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 69 predicate places. [2022-01-19 05:44:51,458 INFO L470 AbstractCegarLoop]: Abstraction has has 188 places, 119 transitions, 484 flow [2022-01-19 05:44:51,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 94.25925925925925) internal successors, (2545), 27 states have internal predecessors, (2545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:51,458 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:44:51,458 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:44:51,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-19 05:44:51,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:44:51,671 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 05:44:51,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:44:51,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1569100019, now seen corresponding path program 5 times [2022-01-19 05:44:51,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:44:51,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295207677] [2022-01-19 05:44:51,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:44:51,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:44:51,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:44:51,769 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:44:51,769 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:44:51,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295207677] [2022-01-19 05:44:51,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295207677] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 05:44:51,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389596765] [2022-01-19 05:44:51,769 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-19 05:44:51,769 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:44:51,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 05:44:51,770 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 05:44:51,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-19 05:44:51,840 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 05:44:51,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 05:44:51,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-19 05:44:51,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 05:44:52,145 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:44:52,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 05:44:52,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:44:52,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389596765] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 05:44:52,323 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 05:44:52,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 29 [2022-01-19 05:44:52,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098287912] [2022-01-19 05:44:52,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 05:44:52,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-19 05:44:52,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:44:52,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-19 05:44:52,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2022-01-19 05:44:52,325 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 132 [2022-01-19 05:44:52,326 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 119 transitions, 484 flow. Second operand has 29 states, 29 states have (on average 94.24137931034483) internal successors, (2733), 29 states have internal predecessors, (2733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:52,326 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:44:52,326 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 132 [2022-01-19 05:44:52,326 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:44:53,355 INFO L129 PetriNetUnfolder]: 150/825 cut-off events. [2022-01-19 05:44:53,355 INFO L130 PetriNetUnfolder]: For 3354/3396 co-relation queries the response was YES. [2022-01-19 05:44:53,357 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2662 conditions, 825 events. 150/825 cut-off events. For 3354/3396 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 4844 event pairs, 13 based on Foata normal form. 16/826 useless extension candidates. Maximal degree in co-relation 2577. Up to 107 conditions per place. [2022-01-19 05:44:53,359 INFO L132 encePairwiseOnDemand]: 116/132 looper letters, 31 selfloop transitions, 21 changer transitions 121/251 dead transitions. [2022-01-19 05:44:53,359 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 251 transitions, 2132 flow [2022-01-19 05:44:53,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-01-19 05:44:53,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2022-01-19 05:44:53,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 5053 transitions. [2022-01-19 05:44:53,365 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7222698684962836 [2022-01-19 05:44:53,365 INFO L72 ComplementDD]: Start complementDD. Operand 53 states and 5053 transitions. [2022-01-19 05:44:53,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 5053 transitions. [2022-01-19 05:44:53,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:44:53,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 53 states and 5053 transitions. [2022-01-19 05:44:53,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 54 states, 53 states have (on average 95.33962264150944) internal successors, (5053), 53 states have internal predecessors, (5053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:53,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 54 states, 54 states have (on average 132.0) internal successors, (7128), 54 states have internal predecessors, (7128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:53,375 INFO L81 ComplementDD]: Finished complementDD. Result has 54 states, 54 states have (on average 132.0) internal successors, (7128), 54 states have internal predecessors, (7128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:53,375 INFO L186 Difference]: Start difference. First operand has 188 places, 119 transitions, 484 flow. Second operand 53 states and 5053 transitions. [2022-01-19 05:44:53,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 251 transitions, 2132 flow [2022-01-19 05:44:53,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 251 transitions, 1803 flow, removed 144 selfloop flow, removed 25 redundant places. [2022-01-19 05:44:53,383 INFO L242 Difference]: Finished difference. Result has 219 places, 117 transitions, 531 flow [2022-01-19 05:44:53,383 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=531, PETRI_PLACES=219, PETRI_TRANSITIONS=117} [2022-01-19 05:44:53,384 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 100 predicate places. [2022-01-19 05:44:53,384 INFO L470 AbstractCegarLoop]: Abstraction has has 219 places, 117 transitions, 531 flow [2022-01-19 05:44:53,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 94.24137931034483) internal successors, (2733), 29 states have internal predecessors, (2733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:53,384 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:44:53,385 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:44:53,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-01-19 05:44:53,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:44:53,601 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 05:44:53,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:44:53,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1279093923, now seen corresponding path program 6 times [2022-01-19 05:44:53,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:44:53,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015558416] [2022-01-19 05:44:53,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:44:53,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:44:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:44:53,697 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:44:53,697 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:44:53,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015558416] [2022-01-19 05:44:53,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015558416] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 05:44:53,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748056165] [2022-01-19 05:44:53,697 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-19 05:44:53,698 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:44:53,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 05:44:53,699 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 05:44:53,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-19 05:44:53,772 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-01-19 05:44:53,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 05:44:53,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-19 05:44:53,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 05:44:54,101 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:44:54,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 05:44:54,259 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 05:44:54,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748056165] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 05:44:54,260 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 05:44:54,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 27 [2022-01-19 05:44:54,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039557860] [2022-01-19 05:44:54,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 05:44:54,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 05:44:54,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:44:54,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 05:44:54,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=626, Unknown=0, NotChecked=0, Total=702 [2022-01-19 05:44:54,262 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 132 [2022-01-19 05:44:54,263 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 117 transitions, 531 flow. Second operand has 27 states, 27 states have (on average 94.25925925925925) internal successors, (2545), 27 states have internal predecessors, (2545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:54,263 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:44:54,263 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 132 [2022-01-19 05:44:54,263 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:44:54,811 INFO L129 PetriNetUnfolder]: 75/456 cut-off events. [2022-01-19 05:44:54,811 INFO L130 PetriNetUnfolder]: For 3572/3602 co-relation queries the response was YES. [2022-01-19 05:44:54,813 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1807 conditions, 456 events. 75/456 cut-off events. For 3572/3602 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1929 event pairs, 8 based on Foata normal form. 7/454 useless extension candidates. Maximal degree in co-relation 1707. Up to 66 conditions per place. [2022-01-19 05:44:54,814 INFO L132 encePairwiseOnDemand]: 116/132 looper letters, 31 selfloop transitions, 18 changer transitions 51/178 dead transitions. [2022-01-19 05:44:54,814 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 178 transitions, 1513 flow [2022-01-19 05:44:54,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-19 05:44:54,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-01-19 05:44:54,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 3045 transitions. [2022-01-19 05:44:54,824 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7208806818181818 [2022-01-19 05:44:54,824 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 3045 transitions. [2022-01-19 05:44:54,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 3045 transitions. [2022-01-19 05:44:54,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:44:54,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 3045 transitions. [2022-01-19 05:44:54,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 95.15625) internal successors, (3045), 32 states have internal predecessors, (3045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:54,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 132.0) internal successors, (4356), 33 states have internal predecessors, (4356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:54,830 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 132.0) internal successors, (4356), 33 states have internal predecessors, (4356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:54,830 INFO L186 Difference]: Start difference. First operand has 219 places, 117 transitions, 531 flow. Second operand 32 states and 3045 transitions. [2022-01-19 05:44:54,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 178 transitions, 1513 flow [2022-01-19 05:44:54,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 178 transitions, 1016 flow, removed 232 selfloop flow, removed 37 redundant places. [2022-01-19 05:44:54,837 INFO L242 Difference]: Finished difference. Result has 185 places, 115 transitions, 429 flow [2022-01-19 05:44:54,837 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=429, PETRI_PLACES=185, PETRI_TRANSITIONS=115} [2022-01-19 05:44:54,838 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 66 predicate places. [2022-01-19 05:44:54,838 INFO L470 AbstractCegarLoop]: Abstraction has has 185 places, 115 transitions, 429 flow [2022-01-19 05:44:54,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 94.25925925925925) internal successors, (2545), 27 states have internal predecessors, (2545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:54,838 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:44:54,838 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:44:54,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-01-19 05:44:55,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-01-19 05:44:55,051 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 05:44:55,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:44:55,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1202191549, now seen corresponding path program 7 times [2022-01-19 05:44:55,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:44:55,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320675440] [2022-01-19 05:44:55,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:44:55,052 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:44:55,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:44:55,142 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:44:55,142 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:44:55,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320675440] [2022-01-19 05:44:55,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320675440] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 05:44:55,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501463057] [2022-01-19 05:44:55,143 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-19 05:44:55,143 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:44:55,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 05:44:55,144 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 05:44:55,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-19 05:44:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:44:55,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-19 05:44:55,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 05:44:55,521 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:44:55,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 05:44:55,690 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 05:44:55,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501463057] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 05:44:55,690 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 05:44:55,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 27 [2022-01-19 05:44:55,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119462488] [2022-01-19 05:44:55,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 05:44:55,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 05:44:55,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:44:55,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 05:44:55,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2022-01-19 05:44:55,692 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 132 [2022-01-19 05:44:55,693 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 115 transitions, 429 flow. Second operand has 27 states, 27 states have (on average 94.25925925925925) internal successors, (2545), 27 states have internal predecessors, (2545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:55,693 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:44:55,693 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 132 [2022-01-19 05:44:55,693 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:44:56,297 INFO L129 PetriNetUnfolder]: 54/367 cut-off events. [2022-01-19 05:44:56,297 INFO L130 PetriNetUnfolder]: For 1497/1509 co-relation queries the response was YES. [2022-01-19 05:44:56,298 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1163 conditions, 367 events. 54/367 cut-off events. For 1497/1509 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1391 event pairs, 3 based on Foata normal form. 15/377 useless extension candidates. Maximal degree in co-relation 1130. Up to 41 conditions per place. [2022-01-19 05:44:56,299 INFO L132 encePairwiseOnDemand]: 116/132 looper letters, 0 selfloop transitions, 0 changer transitions 173/173 dead transitions. [2022-01-19 05:44:56,299 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 173 transitions, 1262 flow [2022-01-19 05:44:56,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-01-19 05:44:56,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-01-19 05:44:56,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 3414 transitions. [2022-01-19 05:44:56,302 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7184343434343434 [2022-01-19 05:44:56,302 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 3414 transitions. [2022-01-19 05:44:56,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 3414 transitions. [2022-01-19 05:44:56,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:44:56,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 3414 transitions. [2022-01-19 05:44:56,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 94.83333333333333) internal successors, (3414), 36 states have internal predecessors, (3414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:56,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 132.0) internal successors, (4884), 37 states have internal predecessors, (4884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:56,309 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 132.0) internal successors, (4884), 37 states have internal predecessors, (4884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:56,309 INFO L186 Difference]: Start difference. First operand has 185 places, 115 transitions, 429 flow. Second operand 36 states and 3414 transitions. [2022-01-19 05:44:56,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 173 transitions, 1262 flow [2022-01-19 05:44:56,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 173 transitions, 964 flow, removed 116 selfloop flow, removed 27 redundant places. [2022-01-19 05:44:56,314 INFO L242 Difference]: Finished difference. Result has 173 places, 0 transitions, 0 flow [2022-01-19 05:44:56,314 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=0, PETRI_PLACES=173, PETRI_TRANSITIONS=0} [2022-01-19 05:44:56,314 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 54 predicate places. [2022-01-19 05:44:56,314 INFO L470 AbstractCegarLoop]: Abstraction has has 173 places, 0 transitions, 0 flow [2022-01-19 05:44:56,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 94.25925925925925) internal successors, (2545), 27 states have internal predecessors, (2545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:56,315 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-01-19 05:44:56,315 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2022-01-19 05:44:56,315 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2022-01-19 05:44:56,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-19 05:44:56,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-01-19 05:44:56,532 INFO L732 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1] [2022-01-19 05:44:56,532 INFO L309 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2022-01-19 05:44:56,533 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2022-01-19 05:44:56,534 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 05:44:56,534 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-01-19 05:44:56,534 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 134 places, 132 transitions, 288 flow [2022-01-19 05:44:56,541 INFO L129 PetriNetUnfolder]: 9/151 cut-off events. [2022-01-19 05:44:56,541 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 05:44:56,542 INFO L84 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 151 events. 9/151 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 236 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 160. Up to 6 conditions per place. [2022-01-19 05:44:56,542 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 132 transitions, 288 flow [2022-01-19 05:44:56,542 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 118 transitions, 251 flow [2022-01-19 05:44:56,550 INFO L129 PetriNetUnfolder]: 8/138 cut-off events. [2022-01-19 05:44:56,550 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 05:44:56,550 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:44:56,550 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:44:56,551 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-19 05:44:56,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:44:56,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1597974071, now seen corresponding path program 1 times [2022-01-19 05:44:56,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:44:56,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133898717] [2022-01-19 05:44:56,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:44:56,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:44:56,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 05:44:56,568 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 05:44:56,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 05:44:56,594 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 05:44:56,595 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 05:44:56,595 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 2 remaining) [2022-01-19 05:44:56,595 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 2 remaining) [2022-01-19 05:44:56,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-19 05:44:56,595 INFO L732 BasicCegarLoop]: Path program histogram: [1] [2022-01-19 05:44:56,596 INFO L309 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (2/2) [2022-01-19 05:44:56,596 WARN L235 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-01-19 05:44:56,596 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-01-19 05:44:56,609 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,609 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,609 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,609 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,609 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,609 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,609 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,609 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,610 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,610 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,610 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,610 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,610 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,610 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,610 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,610 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,610 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,611 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,611 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,611 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,611 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,611 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,611 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,611 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,611 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,611 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,611 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,611 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,611 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,611 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,611 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,611 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,611 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,611 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,612 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,612 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,612 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,612 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,612 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,612 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,612 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,612 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,612 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,612 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,613 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,613 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,613 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,613 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,613 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,613 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,613 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,613 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,613 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,613 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,613 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,613 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,613 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,613 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,613 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,614 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,614 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,614 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,614 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,614 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,614 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,614 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,614 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,614 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,614 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,614 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,614 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,614 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,617 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,617 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,617 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,617 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,617 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,618 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,618 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,618 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,618 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,618 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,618 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,618 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,618 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,618 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,618 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,618 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,618 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,618 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,618 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,618 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,618 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,618 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,619 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,619 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,619 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,619 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,619 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,619 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,619 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,619 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,619 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,619 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,619 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,619 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,619 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,619 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,619 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,619 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,619 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,620 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,620 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,620 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,620 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,620 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,620 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,620 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,620 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,620 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,620 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,620 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,620 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,620 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,620 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,621 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,621 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,621 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,622 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,622 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,622 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,622 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,622 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,622 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,622 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,622 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,622 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,622 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,622 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,622 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,622 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,622 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,622 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,622 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,622 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,623 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,623 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,623 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,623 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,623 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,623 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,623 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,623 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,623 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,623 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,623 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,623 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,623 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,623 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,623 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,623 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,623 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,623 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,623 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,624 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,624 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,624 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,624 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,624 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,624 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,625 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,625 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,625 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,625 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,625 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,625 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,625 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,625 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,625 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,625 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,625 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,625 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,625 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,625 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,625 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,625 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,626 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,626 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,626 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,626 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,626 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,626 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,626 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,626 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,626 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,626 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,627 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,627 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,627 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,627 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,627 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,627 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,627 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,627 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,627 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,627 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,627 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,627 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,627 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,627 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,628 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,628 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,628 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,628 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,628 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,628 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,628 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,628 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,628 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,628 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,628 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,628 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,629 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,629 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,629 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,629 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,629 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,629 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,629 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,629 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,629 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,629 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,629 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,630 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:44:56,630 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-19 05:44:56,631 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 05:44:56,632 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 05:44:56,632 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-19 05:44:56,633 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 169 places, 166 transitions, 374 flow [2022-01-19 05:44:56,644 INFO L129 PetriNetUnfolder]: 12/191 cut-off events. [2022-01-19 05:44:56,644 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-01-19 05:44:56,644 INFO L84 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 191 events. 12/191 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 345 event pairs, 0 based on Foata normal form. 0/174 useless extension candidates. Maximal degree in co-relation 205. Up to 8 conditions per place. [2022-01-19 05:44:56,644 INFO L82 GeneralOperation]: Start removeDead. Operand has 169 places, 166 transitions, 374 flow [2022-01-19 05:44:56,647 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 139 transitions, 302 flow [2022-01-19 05:44:56,649 INFO L129 PetriNetUnfolder]: 2/60 cut-off events. [2022-01-19 05:44:56,649 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 05:44:56,649 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:44:56,649 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] [2022-01-19 05:44:56,649 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 05:44:56,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:44:56,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1770621139, now seen corresponding path program 1 times [2022-01-19 05:44:56,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:44:56,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350177848] [2022-01-19 05:44:56,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:44:56,650 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:44:56,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:44:56,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 05:44:56,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:44:56,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350177848] [2022-01-19 05:44:56,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350177848] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:44:56,743 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:44:56,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 05:44:56,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741309472] [2022-01-19 05:44:56,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:44:56,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 05:44:56,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:44:56,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 05:44:56,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-01-19 05:44:56,745 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 166 [2022-01-19 05:44:56,745 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 139 transitions, 302 flow. Second operand has 9 states, 9 states have (on average 120.44444444444444) internal successors, (1084), 9 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:56,745 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:44:56,745 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 166 [2022-01-19 05:44:56,746 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:44:57,813 INFO L129 PetriNetUnfolder]: 7591/14052 cut-off events. [2022-01-19 05:44:57,813 INFO L130 PetriNetUnfolder]: For 1068/1068 co-relation queries the response was YES. [2022-01-19 05:44:57,845 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25057 conditions, 14052 events. 7591/14052 cut-off events. For 1068/1068 co-relation queries the response was YES. Maximal size of possible extension queue 814. Compared 122761 event pairs, 1604 based on Foata normal form. 1284/12097 useless extension candidates. Maximal degree in co-relation 24999. Up to 2582 conditions per place. [2022-01-19 05:44:57,873 INFO L132 encePairwiseOnDemand]: 149/166 looper letters, 39 selfloop transitions, 7 changer transitions 93/237 dead transitions. [2022-01-19 05:44:57,874 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 237 transitions, 850 flow [2022-01-19 05:44:57,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 05:44:57,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 05:44:57,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1478 transitions. [2022-01-19 05:44:57,875 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8094194961664841 [2022-01-19 05:44:57,876 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1478 transitions. [2022-01-19 05:44:57,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1478 transitions. [2022-01-19 05:44:57,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:44:57,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1478 transitions. [2022-01-19 05:44:57,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 134.36363636363637) internal successors, (1478), 11 states have internal predecessors, (1478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:57,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 166.0) internal successors, (1992), 12 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:57,879 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 166.0) internal successors, (1992), 12 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:57,879 INFO L186 Difference]: Start difference. First operand has 140 places, 139 transitions, 302 flow. Second operand 11 states and 1478 transitions. [2022-01-19 05:44:57,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 237 transitions, 850 flow [2022-01-19 05:44:57,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 237 transitions, 831 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-01-19 05:44:57,882 INFO L242 Difference]: Finished difference. Result has 153 places, 131 transitions, 325 flow [2022-01-19 05:44:57,882 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=325, PETRI_PLACES=153, PETRI_TRANSITIONS=131} [2022-01-19 05:44:57,883 INFO L334 CegarLoopForPetriNet]: 140 programPoint places, 13 predicate places. [2022-01-19 05:44:57,883 INFO L470 AbstractCegarLoop]: Abstraction has has 153 places, 131 transitions, 325 flow [2022-01-19 05:44:57,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 120.44444444444444) internal successors, (1084), 9 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:57,883 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:44:57,883 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] [2022-01-19 05:44:57,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-19 05:44:57,883 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 05:44:57,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:44:57,884 INFO L85 PathProgramCache]: Analyzing trace with hash 21293343, now seen corresponding path program 1 times [2022-01-19 05:44:57,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:44:57,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288343873] [2022-01-19 05:44:57,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:44:57,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:44:57,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:44:57,941 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 05:44:57,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:44:57,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288343873] [2022-01-19 05:44:57,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288343873] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:44:57,942 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:44:57,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 05:44:57,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297373531] [2022-01-19 05:44:57,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:44:57,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 05:44:57,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:44:57,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 05:44:57,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-01-19 05:44:57,944 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 166 [2022-01-19 05:44:57,945 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 131 transitions, 325 flow. Second operand has 9 states, 9 states have (on average 120.0) internal successors, (1080), 9 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:57,945 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:44:57,945 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 166 [2022-01-19 05:44:57,945 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:44:58,992 INFO L129 PetriNetUnfolder]: 6948/12281 cut-off events. [2022-01-19 05:44:58,992 INFO L130 PetriNetUnfolder]: For 5619/5619 co-relation queries the response was YES. [2022-01-19 05:44:59,022 INFO L84 FinitePrefix]: Finished finitePrefix Result has 28332 conditions, 12281 events. 6948/12281 cut-off events. For 5619/5619 co-relation queries the response was YES. Maximal size of possible extension queue 717. Compared 99127 event pairs, 721 based on Foata normal form. 145/10366 useless extension candidates. Maximal degree in co-relation 28269. Up to 3716 conditions per place. [2022-01-19 05:44:59,065 INFO L132 encePairwiseOnDemand]: 153/166 looper letters, 93 selfloop transitions, 18 changer transitions 60/267 dead transitions. [2022-01-19 05:44:59,066 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 267 transitions, 1114 flow [2022-01-19 05:44:59,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-19 05:44:59,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-19 05:44:59,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1943 transitions. [2022-01-19 05:44:59,067 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7803212851405622 [2022-01-19 05:44:59,067 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1943 transitions. [2022-01-19 05:44:59,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1943 transitions. [2022-01-19 05:44:59,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:44:59,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1943 transitions. [2022-01-19 05:44:59,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 129.53333333333333) internal successors, (1943), 15 states have internal predecessors, (1943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:59,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 166.0) internal successors, (2656), 16 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:59,071 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 166.0) internal successors, (2656), 16 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:59,071 INFO L186 Difference]: Start difference. First operand has 153 places, 131 transitions, 325 flow. Second operand 15 states and 1943 transitions. [2022-01-19 05:44:59,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 267 transitions, 1114 flow [2022-01-19 05:44:59,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 267 transitions, 1085 flow, removed 8 selfloop flow, removed 6 redundant places. [2022-01-19 05:44:59,112 INFO L242 Difference]: Finished difference. Result has 161 places, 142 transitions, 443 flow [2022-01-19 05:44:59,113 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=443, PETRI_PLACES=161, PETRI_TRANSITIONS=142} [2022-01-19 05:44:59,113 INFO L334 CegarLoopForPetriNet]: 140 programPoint places, 21 predicate places. [2022-01-19 05:44:59,113 INFO L470 AbstractCegarLoop]: Abstraction has has 161 places, 142 transitions, 443 flow [2022-01-19 05:44:59,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 120.0) internal successors, (1080), 9 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:59,113 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:44:59,113 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:44:59,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-19 05:44:59,113 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 05:44:59,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:44:59,114 INFO L85 PathProgramCache]: Analyzing trace with hash -856292385, now seen corresponding path program 1 times [2022-01-19 05:44:59,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:44:59,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23747385] [2022-01-19 05:44:59,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:44:59,114 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:44:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:44:59,180 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:44:59,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:44:59,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23747385] [2022-01-19 05:44:59,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23747385] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 05:44:59,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899043716] [2022-01-19 05:44:59,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:44:59,181 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:44:59,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 05:44:59,182 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 05:44:59,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-19 05:44:59,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:44:59,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-19 05:44:59,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 05:44:59,562 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:44:59,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 05:44:59,704 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:44:59,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899043716] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 05:44:59,705 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 05:44:59,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 25 [2022-01-19 05:44:59,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348955993] [2022-01-19 05:44:59,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 05:44:59,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-19 05:44:59,705 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:44:59,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-19 05:44:59,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2022-01-19 05:44:59,707 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 166 [2022-01-19 05:44:59,708 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 142 transitions, 443 flow. Second operand has 25 states, 25 states have (on average 119.4) internal successors, (2985), 25 states have internal predecessors, (2985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:44:59,708 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:44:59,708 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 166 [2022-01-19 05:44:59,708 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:45:01,844 INFO L129 PetriNetUnfolder]: 10314/19312 cut-off events. [2022-01-19 05:45:01,845 INFO L130 PetriNetUnfolder]: For 29939/29947 co-relation queries the response was YES. [2022-01-19 05:45:01,900 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52349 conditions, 19312 events. 10314/19312 cut-off events. For 29939/29947 co-relation queries the response was YES. Maximal size of possible extension queue 1102. Compared 169717 event pairs, 1498 based on Foata normal form. 377/17467 useless extension candidates. Maximal degree in co-relation 52279. Up to 4967 conditions per place. [2022-01-19 05:45:01,960 INFO L132 encePairwiseOnDemand]: 150/166 looper letters, 137 selfloop transitions, 50 changer transitions 124/406 dead transitions. [2022-01-19 05:45:01,960 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 406 transitions, 2314 flow [2022-01-19 05:45:01,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-19 05:45:01,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-01-19 05:45:01,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 3214 transitions. [2022-01-19 05:45:01,963 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7744578313253012 [2022-01-19 05:45:01,963 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 3214 transitions. [2022-01-19 05:45:01,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 3214 transitions. [2022-01-19 05:45:01,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:45:01,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 3214 transitions. [2022-01-19 05:45:01,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 128.56) internal successors, (3214), 25 states have internal predecessors, (3214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:45:01,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 166.0) internal successors, (4316), 26 states have internal predecessors, (4316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:45:01,968 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 166.0) internal successors, (4316), 26 states have internal predecessors, (4316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:45:01,968 INFO L186 Difference]: Start difference. First operand has 161 places, 142 transitions, 443 flow. Second operand 25 states and 3214 transitions. [2022-01-19 05:45:01,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 406 transitions, 2314 flow [2022-01-19 05:45:02,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 406 transitions, 2167 flow, removed 60 selfloop flow, removed 7 redundant places. [2022-01-19 05:45:02,183 INFO L242 Difference]: Finished difference. Result has 187 places, 186 transitions, 874 flow [2022-01-19 05:45:02,183 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=874, PETRI_PLACES=187, PETRI_TRANSITIONS=186} [2022-01-19 05:45:02,183 INFO L334 CegarLoopForPetriNet]: 140 programPoint places, 47 predicate places. [2022-01-19 05:45:02,184 INFO L470 AbstractCegarLoop]: Abstraction has has 187 places, 186 transitions, 874 flow [2022-01-19 05:45:02,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 119.4) internal successors, (2985), 25 states have internal predecessors, (2985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:45:02,184 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:45:02,184 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:45:02,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-01-19 05:45:02,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:45:02,398 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 05:45:02,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:45:02,398 INFO L85 PathProgramCache]: Analyzing trace with hash 548833052, now seen corresponding path program 1 times [2022-01-19 05:45:02,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:45:02,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558014814] [2022-01-19 05:45:02,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:45:02,399 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:45:02,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:45:02,462 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-19 05:45:02,462 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:45:02,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558014814] [2022-01-19 05:45:02,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558014814] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 05:45:02,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413679896] [2022-01-19 05:45:02,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:45:02,462 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:45:02,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 05:45:02,463 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 05:45:02,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-19 05:45:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:45:02,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-19 05:45:02,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 05:45:02,793 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:45:02,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 05:45:02,967 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:45:02,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413679896] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 05:45:02,967 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 05:45:02,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 29 [2022-01-19 05:45:02,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823574953] [2022-01-19 05:45:02,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 05:45:02,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-19 05:45:02,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:45:02,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-19 05:45:02,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=687, Unknown=0, NotChecked=0, Total=812 [2022-01-19 05:45:02,970 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 166 [2022-01-19 05:45:02,971 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 186 transitions, 874 flow. Second operand has 29 states, 29 states have (on average 119.48275862068965) internal successors, (3465), 29 states have internal predecessors, (3465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:45:02,971 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:45:02,971 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 166 [2022-01-19 05:45:02,971 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:45:05,773 INFO L129 PetriNetUnfolder]: 9456/19343 cut-off events. [2022-01-19 05:45:05,774 INFO L130 PetriNetUnfolder]: For 55156/55366 co-relation queries the response was YES. [2022-01-19 05:45:05,853 INFO L84 FinitePrefix]: Finished finitePrefix Result has 61110 conditions, 19343 events. 9456/19343 cut-off events. For 55156/55366 co-relation queries the response was YES. Maximal size of possible extension queue 1209. Compared 184057 event pairs, 1359 based on Foata normal form. 589/17789 useless extension candidates. Maximal degree in co-relation 61031. Up to 3512 conditions per place. [2022-01-19 05:45:05,893 INFO L132 encePairwiseOnDemand]: 150/166 looper letters, 185 selfloop transitions, 85 changer transitions 178/543 dead transitions. [2022-01-19 05:45:05,893 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 543 transitions, 4094 flow [2022-01-19 05:45:05,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-19 05:45:05,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-01-19 05:45:05,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 3588 transitions. [2022-01-19 05:45:05,895 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7719449225473322 [2022-01-19 05:45:05,896 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 3588 transitions. [2022-01-19 05:45:05,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 3588 transitions. [2022-01-19 05:45:05,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:45:05,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 3588 transitions. [2022-01-19 05:45:05,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 128.14285714285714) internal successors, (3588), 28 states have internal predecessors, (3588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:45:05,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 166.0) internal successors, (4814), 29 states have internal predecessors, (4814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:45:05,902 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 166.0) internal successors, (4814), 29 states have internal predecessors, (4814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:45:05,902 INFO L186 Difference]: Start difference. First operand has 187 places, 186 transitions, 874 flow. Second operand 28 states and 3588 transitions. [2022-01-19 05:45:05,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 543 transitions, 4094 flow [2022-01-19 05:45:06,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 543 transitions, 3928 flow, removed 79 selfloop flow, removed 9 redundant places. [2022-01-19 05:45:06,502 INFO L242 Difference]: Finished difference. Result has 211 places, 238 transitions, 1592 flow [2022-01-19 05:45:06,502 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=816, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1592, PETRI_PLACES=211, PETRI_TRANSITIONS=238} [2022-01-19 05:45:06,503 INFO L334 CegarLoopForPetriNet]: 140 programPoint places, 71 predicate places. [2022-01-19 05:45:06,503 INFO L470 AbstractCegarLoop]: Abstraction has has 211 places, 238 transitions, 1592 flow [2022-01-19 05:45:06,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 119.48275862068965) internal successors, (3465), 29 states have internal predecessors, (3465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:45:06,503 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:45:06,503 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:45:06,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-01-19 05:45:06,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:45:06,711 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 05:45:06,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:45:06,712 INFO L85 PathProgramCache]: Analyzing trace with hash 319854882, now seen corresponding path program 1 times [2022-01-19 05:45:06,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:45:06,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616735363] [2022-01-19 05:45:06,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:45:06,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:45:06,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:45:06,735 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:45:06,736 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:45:06,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616735363] [2022-01-19 05:45:06,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616735363] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:45:06,736 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:45:06,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 05:45:06,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233720524] [2022-01-19 05:45:06,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:45:06,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 05:45:06,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:45:06,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 05:45:06,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 05:45:06,737 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 166 [2022-01-19 05:45:06,738 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 238 transitions, 1592 flow. Second operand has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:45:06,738 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:45:06,738 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 166 [2022-01-19 05:45:06,738 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:45:06,972 INFO L129 PetriNetUnfolder]: 428/2480 cut-off events. [2022-01-19 05:45:06,972 INFO L130 PetriNetUnfolder]: For 8849/9122 co-relation queries the response was YES. [2022-01-19 05:45:06,987 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7074 conditions, 2480 events. 428/2480 cut-off events. For 8849/9122 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 22578 event pairs, 195 based on Foata normal form. 36/2279 useless extension candidates. Maximal degree in co-relation 6986. Up to 231 conditions per place. [2022-01-19 05:45:06,994 INFO L132 encePairwiseOnDemand]: 160/166 looper letters, 12 selfloop transitions, 6 changer transitions 0/217 dead transitions. [2022-01-19 05:45:06,994 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 217 transitions, 1300 flow [2022-01-19 05:45:06,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 05:45:06,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 05:45:06,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 432 transitions. [2022-01-19 05:45:06,995 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8674698795180723 [2022-01-19 05:45:06,995 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 432 transitions. [2022-01-19 05:45:06,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 432 transitions. [2022-01-19 05:45:06,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:45:06,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 432 transitions. [2022-01-19 05:45:06,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:45:06,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:45:06,996 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:45:06,996 INFO L186 Difference]: Start difference. First operand has 211 places, 238 transitions, 1592 flow. Second operand 3 states and 432 transitions. [2022-01-19 05:45:06,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 217 transitions, 1300 flow [2022-01-19 05:45:07,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 217 transitions, 1133 flow, removed 58 selfloop flow, removed 14 redundant places. [2022-01-19 05:45:07,015 INFO L242 Difference]: Finished difference. Result has 189 places, 215 transitions, 1095 flow [2022-01-19 05:45:07,015 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=1083, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1095, PETRI_PLACES=189, PETRI_TRANSITIONS=215} [2022-01-19 05:45:07,016 INFO L334 CegarLoopForPetriNet]: 140 programPoint places, 49 predicate places. [2022-01-19 05:45:07,016 INFO L470 AbstractCegarLoop]: Abstraction has has 189 places, 215 transitions, 1095 flow [2022-01-19 05:45:07,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:45:07,016 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:45:07,016 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:45:07,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-19 05:45:07,016 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 05:45:07,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:45:07,016 INFO L85 PathProgramCache]: Analyzing trace with hash 738571804, now seen corresponding path program 1 times [2022-01-19 05:45:07,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:45:07,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113267312] [2022-01-19 05:45:07,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:45:07,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:45:07,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:45:07,100 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:45:07,101 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:45:07,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113267312] [2022-01-19 05:45:07,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113267312] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 05:45:07,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130364853] [2022-01-19 05:45:07,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:45:07,101 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:45:07,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 05:45:07,102 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 05:45:07,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-01-19 05:45:07,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:45:07,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-19 05:45:07,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 05:45:07,484 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:45:07,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 05:45:07,643 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:45:07,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130364853] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 05:45:07,643 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 05:45:07,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 29 [2022-01-19 05:45:07,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110188325] [2022-01-19 05:45:07,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 05:45:07,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-19 05:45:07,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:45:07,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-19 05:45:07,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=719, Unknown=0, NotChecked=0, Total=812 [2022-01-19 05:45:07,645 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 166 [2022-01-19 05:45:07,647 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 215 transitions, 1095 flow. Second operand has 29 states, 29 states have (on average 118.17241379310344) internal successors, (3427), 29 states have internal predecessors, (3427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:45:07,647 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:45:07,647 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 166 [2022-01-19 05:45:07,647 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:45:10,888 INFO L129 PetriNetUnfolder]: 5344/14140 cut-off events. [2022-01-19 05:45:10,889 INFO L130 PetriNetUnfolder]: For 40334/40643 co-relation queries the response was YES. [2022-01-19 05:45:10,988 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45666 conditions, 14140 events. 5344/14140 cut-off events. For 40334/40643 co-relation queries the response was YES. Maximal size of possible extension queue 650. Compared 144496 event pairs, 1167 based on Foata normal form. 182/13077 useless extension candidates. Maximal degree in co-relation 45588. Up to 2335 conditions per place. [2022-01-19 05:45:11,037 INFO L132 encePairwiseOnDemand]: 149/166 looper letters, 362 selfloop transitions, 194 changer transitions 190/840 dead transitions. [2022-01-19 05:45:11,037 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 840 transitions, 6309 flow [2022-01-19 05:45:11,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-01-19 05:45:11,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2022-01-19 05:45:11,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 9590 transitions. [2022-01-19 05:45:11,044 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7502738225629791 [2022-01-19 05:45:11,044 INFO L72 ComplementDD]: Start complementDD. Operand 77 states and 9590 transitions. [2022-01-19 05:45:11,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 9590 transitions. [2022-01-19 05:45:11,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:45:11,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 77 states and 9590 transitions. [2022-01-19 05:45:11,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 78 states, 77 states have (on average 124.54545454545455) internal successors, (9590), 77 states have internal predecessors, (9590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:45:11,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 78 states, 78 states have (on average 166.0) internal successors, (12948), 78 states have internal predecessors, (12948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:45:11,064 INFO L81 ComplementDD]: Finished complementDD. Result has 78 states, 78 states have (on average 166.0) internal successors, (12948), 78 states have internal predecessors, (12948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:45:11,064 INFO L186 Difference]: Start difference. First operand has 189 places, 215 transitions, 1095 flow. Second operand 77 states and 9590 transitions. [2022-01-19 05:45:11,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 840 transitions, 6309 flow [2022-01-19 05:45:11,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 840 transitions, 6303 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 05:45:11,168 INFO L242 Difference]: Finished difference. Result has 309 places, 351 transitions, 2740 flow [2022-01-19 05:45:11,169 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=1089, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=77, PETRI_FLOW=2740, PETRI_PLACES=309, PETRI_TRANSITIONS=351} [2022-01-19 05:45:11,169 INFO L334 CegarLoopForPetriNet]: 140 programPoint places, 169 predicate places. [2022-01-19 05:45:11,169 INFO L470 AbstractCegarLoop]: Abstraction has has 309 places, 351 transitions, 2740 flow [2022-01-19 05:45:11,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 118.17241379310344) internal successors, (3427), 29 states have internal predecessors, (3427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:45:11,170 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:45:11,170 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:45:11,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-01-19 05:45:11,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-01-19 05:45:11,383 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 05:45:11,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:45:11,384 INFO L85 PathProgramCache]: Analyzing trace with hash 450454042, now seen corresponding path program 1 times [2022-01-19 05:45:11,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:45:11,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643742269] [2022-01-19 05:45:11,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:45:11,384 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:45:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:45:11,486 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:45:11,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:45:11,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643742269] [2022-01-19 05:45:11,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643742269] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 05:45:11,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077621811] [2022-01-19 05:45:11,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:45:11,486 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:45:11,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 05:45:11,487 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 05:45:11,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-01-19 05:45:11,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:45:11,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-19 05:45:11,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 05:45:11,856 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:45:11,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 05:45:12,024 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:45:12,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077621811] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 05:45:12,025 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 05:45:12,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 29 [2022-01-19 05:45:12,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609895557] [2022-01-19 05:45:12,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 05:45:12,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-19 05:45:12,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:45:12,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-19 05:45:12,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=706, Unknown=0, NotChecked=0, Total=812 [2022-01-19 05:45:12,028 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 166 [2022-01-19 05:45:12,029 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 351 transitions, 2740 flow. Second operand has 29 states, 29 states have (on average 118.24137931034483) internal successors, (3429), 29 states have internal predecessors, (3429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:45:12,029 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:45:12,029 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 166 [2022-01-19 05:45:12,030 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:45:16,274 INFO L129 PetriNetUnfolder]: 6719/18675 cut-off events. [2022-01-19 05:45:16,274 INFO L130 PetriNetUnfolder]: For 296708/297316 co-relation queries the response was YES. [2022-01-19 05:45:16,422 INFO L84 FinitePrefix]: Finished finitePrefix Result has 86735 conditions, 18675 events. 6719/18675 cut-off events. For 296708/297316 co-relation queries the response was YES. Maximal size of possible extension queue 787. Compared 206805 event pairs, 1324 based on Foata normal form. 133/17083 useless extension candidates. Maximal degree in co-relation 86608. Up to 2291 conditions per place. [2022-01-19 05:45:16,491 INFO L132 encePairwiseOnDemand]: 149/166 looper letters, 447 selfloop transitions, 323 changer transitions 102/966 dead transitions. [2022-01-19 05:45:16,491 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 966 transitions, 9920 flow [2022-01-19 05:45:16,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-01-19 05:45:16,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2022-01-19 05:45:16,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 7872 transitions. [2022-01-19 05:45:16,495 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7527251864601262 [2022-01-19 05:45:16,495 INFO L72 ComplementDD]: Start complementDD. Operand 63 states and 7872 transitions. [2022-01-19 05:45:16,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 7872 transitions. [2022-01-19 05:45:16,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:45:16,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 63 states and 7872 transitions. [2022-01-19 05:45:16,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 64 states, 63 states have (on average 124.95238095238095) internal successors, (7872), 63 states have internal predecessors, (7872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:45:16,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 64 states, 64 states have (on average 166.0) internal successors, (10624), 64 states have internal predecessors, (10624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:45:16,507 INFO L81 ComplementDD]: Finished complementDD. Result has 64 states, 64 states have (on average 166.0) internal successors, (10624), 64 states have internal predecessors, (10624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:45:16,507 INFO L186 Difference]: Start difference. First operand has 309 places, 351 transitions, 2740 flow. Second operand 63 states and 7872 transitions. [2022-01-19 05:45:16,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 966 transitions, 9920 flow [2022-01-19 05:45:17,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 966 transitions, 8501 flow, removed 610 selfloop flow, removed 29 redundant places. [2022-01-19 05:45:17,626 INFO L242 Difference]: Finished difference. Result has 349 places, 530 transitions, 4630 flow [2022-01-19 05:45:17,626 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=2233, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=4630, PETRI_PLACES=349, PETRI_TRANSITIONS=530} [2022-01-19 05:45:17,627 INFO L334 CegarLoopForPetriNet]: 140 programPoint places, 209 predicate places. [2022-01-19 05:45:17,627 INFO L470 AbstractCegarLoop]: Abstraction has has 349 places, 530 transitions, 4630 flow [2022-01-19 05:45:17,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 118.24137931034483) internal successors, (3429), 29 states have internal predecessors, (3429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:45:17,627 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:45:17,627 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:45:17,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-01-19 05:45:17,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-01-19 05:45:17,829 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 05:45:17,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:45:17,829 INFO L85 PathProgramCache]: Analyzing trace with hash -485356080, now seen corresponding path program 2 times [2022-01-19 05:45:17,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:45:17,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020965673] [2022-01-19 05:45:17,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:45:17,830 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:45:17,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:45:17,926 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:45:17,926 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:45:17,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020965673] [2022-01-19 05:45:17,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020965673] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 05:45:17,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121467845] [2022-01-19 05:45:17,927 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 05:45:17,927 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:45:17,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 05:45:17,928 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 05:45:17,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-01-19 05:45:18,019 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 05:45:18,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 05:45:18,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-19 05:45:18,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 05:45:18,294 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:45:18,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 05:45:18,459 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:45:18,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121467845] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 05:45:18,459 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 05:45:18,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 29 [2022-01-19 05:45:18,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306691384] [2022-01-19 05:45:18,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 05:45:18,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-19 05:45:18,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:45:18,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-19 05:45:18,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2022-01-19 05:45:18,462 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 166 [2022-01-19 05:45:18,463 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 530 transitions, 4630 flow. Second operand has 29 states, 29 states have (on average 118.24137931034483) internal successors, (3429), 29 states have internal predecessors, (3429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:45:18,463 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:45:18,463 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 166 [2022-01-19 05:45:18,463 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:45:27,212 INFO L129 PetriNetUnfolder]: 11601/34030 cut-off events. [2022-01-19 05:45:27,212 INFO L130 PetriNetUnfolder]: For 495682/497572 co-relation queries the response was YES. [2022-01-19 05:45:27,781 INFO L84 FinitePrefix]: Finished finitePrefix Result has 153086 conditions, 34030 events. 11601/34030 cut-off events. For 495682/497572 co-relation queries the response was YES. Maximal size of possible extension queue 1468. Compared 425780 event pairs, 3526 based on Foata normal form. 288/31144 useless extension candidates. Maximal degree in co-relation 152949. Up to 6878 conditions per place. [2022-01-19 05:45:27,898 INFO L132 encePairwiseOnDemand]: 149/166 looper letters, 880 selfloop transitions, 669 changer transitions 232/1875 dead transitions. [2022-01-19 05:45:27,898 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 473 places, 1875 transitions, 20736 flow [2022-01-19 05:45:27,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2022-01-19 05:45:27,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2022-01-19 05:45:27,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 16312 transitions. [2022-01-19 05:45:27,906 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7501149636714798 [2022-01-19 05:45:27,906 INFO L72 ComplementDD]: Start complementDD. Operand 131 states and 16312 transitions. [2022-01-19 05:45:27,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 16312 transitions. [2022-01-19 05:45:27,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:45:27,908 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 131 states and 16312 transitions. [2022-01-19 05:45:27,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 132 states, 131 states have (on average 124.51908396946565) internal successors, (16312), 131 states have internal predecessors, (16312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:45:27,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 132 states, 132 states have (on average 166.0) internal successors, (21912), 132 states have internal predecessors, (21912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:45:27,930 INFO L81 ComplementDD]: Finished complementDD. Result has 132 states, 132 states have (on average 166.0) internal successors, (21912), 132 states have internal predecessors, (21912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:45:27,931 INFO L186 Difference]: Start difference. First operand has 349 places, 530 transitions, 4630 flow. Second operand 131 states and 16312 transitions. [2022-01-19 05:45:27,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 473 places, 1875 transitions, 20736 flow [2022-01-19 05:45:29,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 456 places, 1875 transitions, 19624 flow, removed 337 selfloop flow, removed 17 redundant places. [2022-01-19 05:45:29,998 INFO L242 Difference]: Finished difference. Result has 525 places, 996 transitions, 11619 flow [2022-01-19 05:45:29,999 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=4174, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=530, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=247, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=131, PETRI_FLOW=11619, PETRI_PLACES=525, PETRI_TRANSITIONS=996} [2022-01-19 05:45:29,999 INFO L334 CegarLoopForPetriNet]: 140 programPoint places, 385 predicate places. [2022-01-19 05:45:29,999 INFO L470 AbstractCegarLoop]: Abstraction has has 525 places, 996 transitions, 11619 flow [2022-01-19 05:45:29,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 118.24137931034483) internal successors, (3429), 29 states have internal predecessors, (3429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:45:29,999 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:45:30,000 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:45:30,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-01-19 05:45:30,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:45:30,215 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 05:45:30,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:45:30,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1166860424, now seen corresponding path program 3 times [2022-01-19 05:45:30,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:45:30,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099167119] [2022-01-19 05:45:30,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:45:30,216 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:45:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:45:30,294 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:45:30,294 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:45:30,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099167119] [2022-01-19 05:45:30,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099167119] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 05:45:30,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494455506] [2022-01-19 05:45:30,294 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 05:45:30,294 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:45:30,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 05:45:30,295 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 05:45:30,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-01-19 05:45:30,378 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-19 05:45:30,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 05:45:30,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-19 05:45:30,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 05:45:30,647 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:45:30,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 05:45:30,785 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 05:45:30,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494455506] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 05:45:30,785 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 05:45:30,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 27 [2022-01-19 05:45:30,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328001796] [2022-01-19 05:45:30,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 05:45:30,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 05:45:30,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:45:30,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 05:45:30,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2022-01-19 05:45:30,787 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 166 [2022-01-19 05:45:30,789 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 996 transitions, 11619 flow. Second operand has 27 states, 27 states have (on average 118.25925925925925) internal successors, (3193), 27 states have internal predecessors, (3193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:45:30,789 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:45:30,789 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 166 [2022-01-19 05:45:30,789 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:45:40,756 INFO L129 PetriNetUnfolder]: 11908/35993 cut-off events. [2022-01-19 05:45:40,756 INFO L130 PetriNetUnfolder]: For 952579/955322 co-relation queries the response was YES. [2022-01-19 05:45:41,689 INFO L84 FinitePrefix]: Finished finitePrefix Result has 198344 conditions, 35993 events. 11908/35993 cut-off events. For 952579/955322 co-relation queries the response was YES. Maximal size of possible extension queue 1559. Compared 461346 event pairs, 4214 based on Foata normal form. 248/32872 useless extension candidates. Maximal degree in co-relation 198144. Up to 11102 conditions per place. [2022-01-19 05:45:41,834 INFO L132 encePairwiseOnDemand]: 149/166 looper letters, 639 selfloop transitions, 570 changer transitions 71/1374 dead transitions. [2022-01-19 05:45:41,834 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 542 places, 1374 transitions, 18912 flow [2022-01-19 05:45:41,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-01-19 05:45:41,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2022-01-19 05:45:41,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 4731 transitions. [2022-01-19 05:45:41,837 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.75 [2022-01-19 05:45:41,837 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 4731 transitions. [2022-01-19 05:45:41,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 4731 transitions. [2022-01-19 05:45:41,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:45:41,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 4731 transitions. [2022-01-19 05:45:41,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 124.5) internal successors, (4731), 38 states have internal predecessors, (4731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:45:41,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 166.0) internal successors, (6474), 39 states have internal predecessors, (6474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:45:41,843 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 166.0) internal successors, (6474), 39 states have internal predecessors, (6474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:45:41,843 INFO L186 Difference]: Start difference. First operand has 525 places, 996 transitions, 11619 flow. Second operand 38 states and 4731 transitions. [2022-01-19 05:45:41,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 542 places, 1374 transitions, 18912 flow [2022-01-19 05:45:45,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 1374 transitions, 16646 flow, removed 1121 selfloop flow, removed 26 redundant places. [2022-01-19 05:45:45,970 INFO L242 Difference]: Finished difference. Result has 529 places, 1128 transitions, 13565 flow [2022-01-19 05:45:45,970 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=10307, PETRI_DIFFERENCE_MINUEND_PLACES=479, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=996, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=443, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=13565, PETRI_PLACES=529, PETRI_TRANSITIONS=1128} [2022-01-19 05:45:45,971 INFO L334 CegarLoopForPetriNet]: 140 programPoint places, 389 predicate places. [2022-01-19 05:45:45,971 INFO L470 AbstractCegarLoop]: Abstraction has has 529 places, 1128 transitions, 13565 flow [2022-01-19 05:45:45,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 118.25925925925925) internal successors, (3193), 27 states have internal predecessors, (3193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:45:45,971 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:45:45,971 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:45:45,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-01-19 05:45:46,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:45:46,178 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 05:45:46,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:45:46,179 INFO L85 PathProgramCache]: Analyzing trace with hash -73492696, now seen corresponding path program 4 times [2022-01-19 05:45:46,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:45:46,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867856780] [2022-01-19 05:45:46,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:45:46,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:45:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:45:46,270 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:45:46,270 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:45:46,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867856780] [2022-01-19 05:45:46,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867856780] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 05:45:46,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45876558] [2022-01-19 05:45:46,271 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-19 05:45:46,271 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:45:46,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 05:45:46,272 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 05:45:46,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-01-19 05:45:46,356 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-19 05:45:46,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 05:45:46,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-19 05:45:46,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 05:45:46,645 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:45:46,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 05:45:46,808 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:45:46,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45876558] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 05:45:46,808 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 05:45:46,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 29 [2022-01-19 05:45:46,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939480727] [2022-01-19 05:45:46,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 05:45:46,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-19 05:45:46,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:45:46,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-19 05:45:46,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2022-01-19 05:45:46,810 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 166 [2022-01-19 05:45:46,812 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 529 places, 1128 transitions, 13565 flow. Second operand has 29 states, 29 states have (on average 118.24137931034483) internal successors, (3429), 29 states have internal predecessors, (3429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:45:46,812 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:45:46,812 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 166 [2022-01-19 05:45:46,812 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:45:58,562 INFO L129 PetriNetUnfolder]: 12534/38796 cut-off events. [2022-01-19 05:45:58,562 INFO L130 PetriNetUnfolder]: For 908152/910507 co-relation queries the response was YES. [2022-01-19 05:45:59,719 INFO L84 FinitePrefix]: Finished finitePrefix Result has 199616 conditions, 38796 events. 12534/38796 cut-off events. For 908152/910507 co-relation queries the response was YES. Maximal size of possible extension queue 1699. Compared 508980 event pairs, 3847 based on Foata normal form. 229/35496 useless extension candidates. Maximal degree in co-relation 199422. Up to 12856 conditions per place. [2022-01-19 05:46:00,001 INFO L132 encePairwiseOnDemand]: 149/166 looper letters, 1048 selfloop transitions, 422 changer transitions 183/1747 dead transitions. [2022-01-19 05:46:00,001 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 1747 transitions, 24863 flow [2022-01-19 05:46:00,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-01-19 05:46:00,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2022-01-19 05:46:00,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 10398 transitions. [2022-01-19 05:46:00,006 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.745697074010327 [2022-01-19 05:46:00,006 INFO L72 ComplementDD]: Start complementDD. Operand 84 states and 10398 transitions. [2022-01-19 05:46:00,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 10398 transitions. [2022-01-19 05:46:00,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:46:00,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 84 states and 10398 transitions. [2022-01-19 05:46:00,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 85 states, 84 states have (on average 123.78571428571429) internal successors, (10398), 84 states have internal predecessors, (10398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:46:00,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 85 states, 85 states have (on average 166.0) internal successors, (14110), 85 states have internal predecessors, (14110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:46:00,020 INFO L81 ComplementDD]: Finished complementDD. Result has 85 states, 85 states have (on average 166.0) internal successors, (14110), 85 states have internal predecessors, (14110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:46:00,020 INFO L186 Difference]: Start difference. First operand has 529 places, 1128 transitions, 13565 flow. Second operand 84 states and 10398 transitions. [2022-01-19 05:46:00,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 606 places, 1747 transitions, 24863 flow [2022-01-19 05:46:04,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 585 places, 1747 transitions, 24077 flow, removed 202 selfloop flow, removed 21 redundant places. [2022-01-19 05:46:04,318 INFO L242 Difference]: Finished difference. Result has 635 places, 1258 transitions, 16748 flow [2022-01-19 05:46:04,318 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=13075, PETRI_DIFFERENCE_MINUEND_PLACES=502, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=296, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=806, PETRI_DIFFERENCE_SUBTRAHEND_STATES=84, PETRI_FLOW=16748, PETRI_PLACES=635, PETRI_TRANSITIONS=1258} [2022-01-19 05:46:04,319 INFO L334 CegarLoopForPetriNet]: 140 programPoint places, 495 predicate places. [2022-01-19 05:46:04,319 INFO L470 AbstractCegarLoop]: Abstraction has has 635 places, 1258 transitions, 16748 flow [2022-01-19 05:46:04,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 118.24137931034483) internal successors, (3429), 29 states have internal predecessors, (3429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:46:04,319 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:46:04,319 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:46:04,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-01-19 05:46:04,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-01-19 05:46:04,520 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 05:46:04,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:46:04,520 INFO L85 PathProgramCache]: Analyzing trace with hash 2002906060, now seen corresponding path program 5 times [2022-01-19 05:46:04,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:46:04,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385133649] [2022-01-19 05:46:04,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:46:04,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:46:04,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:46:04,612 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:46:04,612 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:46:04,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385133649] [2022-01-19 05:46:04,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385133649] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 05:46:04,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932866715] [2022-01-19 05:46:04,613 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-19 05:46:04,613 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:46:04,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 05:46:04,619 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 05:46:04,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-01-19 05:46:04,709 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 05:46:04,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 05:46:04,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-19 05:46:04,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 05:46:05,078 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:46:05,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 05:46:05,297 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:46:05,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932866715] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 05:46:05,297 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 05:46:05,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30 [2022-01-19 05:46:05,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161863133] [2022-01-19 05:46:05,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 05:46:05,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-01-19 05:46:05,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:46:05,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-01-19 05:46:05,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=779, Unknown=0, NotChecked=0, Total=870 [2022-01-19 05:46:05,300 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 166 [2022-01-19 05:46:05,301 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 1258 transitions, 16748 flow. Second operand has 30 states, 30 states have (on average 112.73333333333333) internal successors, (3382), 30 states have internal predecessors, (3382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:46:05,301 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:46:05,301 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 166 [2022-01-19 05:46:05,301 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:46:22,856 INFO L129 PetriNetUnfolder]: 16182/47115 cut-off events. [2022-01-19 05:46:22,857 INFO L130 PetriNetUnfolder]: For 1520205/1523358 co-relation queries the response was YES. [2022-01-19 05:46:25,123 INFO L84 FinitePrefix]: Finished finitePrefix Result has 266788 conditions, 47115 events. 16182/47115 cut-off events. For 1520205/1523358 co-relation queries the response was YES. Maximal size of possible extension queue 1792. Compared 614696 event pairs, 2695 based on Foata normal form. 307/43258 useless extension candidates. Maximal degree in co-relation 266549. Up to 3879 conditions per place. [2022-01-19 05:46:25,325 INFO L132 encePairwiseOnDemand]: 144/166 looper letters, 865 selfloop transitions, 965 changer transitions 102/2020 dead transitions. [2022-01-19 05:46:25,325 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 693 places, 2020 transitions, 30973 flow [2022-01-19 05:46:25,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-01-19 05:46:25,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2022-01-19 05:46:25,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 9351 transitions. [2022-01-19 05:46:25,329 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7130547506481623 [2022-01-19 05:46:25,329 INFO L72 ComplementDD]: Start complementDD. Operand 79 states and 9351 transitions. [2022-01-19 05:46:25,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 9351 transitions. [2022-01-19 05:46:25,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:46:25,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 79 states and 9351 transitions. [2022-01-19 05:46:25,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 80 states, 79 states have (on average 118.36708860759494) internal successors, (9351), 79 states have internal predecessors, (9351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:46:25,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 80 states, 80 states have (on average 166.0) internal successors, (13280), 80 states have internal predecessors, (13280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:46:25,342 INFO L81 ComplementDD]: Finished complementDD. Result has 80 states, 80 states have (on average 166.0) internal successors, (13280), 80 states have internal predecessors, (13280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:46:25,342 INFO L186 Difference]: Start difference. First operand has 635 places, 1258 transitions, 16748 flow. Second operand 79 states and 9351 transitions. [2022-01-19 05:46:25,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 693 places, 2020 transitions, 30973 flow [2022-01-19 05:46:32,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 657 places, 2020 transitions, 28797 flow, removed 954 selfloop flow, removed 36 redundant places. [2022-01-19 05:46:32,491 INFO L242 Difference]: Finished difference. Result has 673 places, 1452 transitions, 20338 flow [2022-01-19 05:46:32,492 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=15512, PETRI_DIFFERENCE_MINUEND_PLACES=579, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=786, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=466, PETRI_DIFFERENCE_SUBTRAHEND_STATES=79, PETRI_FLOW=20338, PETRI_PLACES=673, PETRI_TRANSITIONS=1452} [2022-01-19 05:46:32,492 INFO L334 CegarLoopForPetriNet]: 140 programPoint places, 533 predicate places. [2022-01-19 05:46:32,492 INFO L470 AbstractCegarLoop]: Abstraction has has 673 places, 1452 transitions, 20338 flow [2022-01-19 05:46:32,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 112.73333333333333) internal successors, (3382), 30 states have internal predecessors, (3382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:46:32,493 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:46:32,493 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:46:32,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-01-19 05:46:32,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-01-19 05:46:32,693 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 05:46:32,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:46:32,694 INFO L85 PathProgramCache]: Analyzing trace with hash 2118636307, now seen corresponding path program 1 times [2022-01-19 05:46:32,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:46:32,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695352671] [2022-01-19 05:46:32,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:46:32,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:46:32,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:46:32,801 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:46:32,801 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:46:32,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695352671] [2022-01-19 05:46:32,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695352671] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 05:46:32,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016192428] [2022-01-19 05:46:32,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:46:32,802 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:46:32,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 05:46:32,803 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 05:46:32,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-01-19 05:46:32,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:46:32,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-19 05:46:32,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 05:46:33,221 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:46:33,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 05:46:33,434 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 05:46:33,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016192428] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 05:46:33,435 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 05:46:33,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 14] total 37 [2022-01-19 05:46:33,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413782741] [2022-01-19 05:46:33,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 05:46:33,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-01-19 05:46:33,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:46:33,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-01-19 05:46:33,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1183, Unknown=0, NotChecked=0, Total=1332 [2022-01-19 05:46:33,438 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 166 [2022-01-19 05:46:33,439 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 673 places, 1452 transitions, 20338 flow. Second operand has 37 states, 37 states have (on average 118.35135135135135) internal successors, (4379), 37 states have internal predecessors, (4379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:46:33,439 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:46:33,439 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 166 [2022-01-19 05:46:33,439 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:46:54,226 INFO L129 PetriNetUnfolder]: 15374/49955 cut-off events. [2022-01-19 05:46:54,227 INFO L130 PetriNetUnfolder]: For 1880670/1889285 co-relation queries the response was YES. [2022-01-19 05:46:56,092 INFO L84 FinitePrefix]: Finished finitePrefix Result has 300565 conditions, 49955 events. 15374/49955 cut-off events. For 1880670/1889285 co-relation queries the response was YES. Maximal size of possible extension queue 2033. Compared 693841 event pairs, 2075 based on Foata normal form. 1796/49103 useless extension candidates. Maximal degree in co-relation 300330. Up to 4128 conditions per place. [2022-01-19 05:46:56,288 INFO L132 encePairwiseOnDemand]: 149/166 looper letters, 1239 selfloop transitions, 1077 changer transitions 894/3338 dead transitions. [2022-01-19 05:46:56,289 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 821 places, 3338 transitions, 52793 flow [2022-01-19 05:46:56,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2022-01-19 05:46:56,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2022-01-19 05:46:56,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 19068 transitions. [2022-01-19 05:46:56,296 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7410804508356005 [2022-01-19 05:46:56,296 INFO L72 ComplementDD]: Start complementDD. Operand 155 states and 19068 transitions. [2022-01-19 05:46:56,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 155 states and 19068 transitions. [2022-01-19 05:46:56,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:46:56,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 155 states and 19068 transitions. [2022-01-19 05:46:56,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 156 states, 155 states have (on average 123.01935483870967) internal successors, (19068), 155 states have internal predecessors, (19068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:46:56,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 156 states, 156 states have (on average 166.0) internal successors, (25896), 156 states have internal predecessors, (25896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:46:56,324 INFO L81 ComplementDD]: Finished complementDD. Result has 156 states, 156 states have (on average 166.0) internal successors, (25896), 156 states have internal predecessors, (25896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:46:56,324 INFO L186 Difference]: Start difference. First operand has 673 places, 1452 transitions, 20338 flow. Second operand 155 states and 19068 transitions. [2022-01-19 05:46:56,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 821 places, 3338 transitions, 52793 flow [2022-01-19 05:47:08,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 798 places, 3338 transitions, 51102 flow, removed 708 selfloop flow, removed 23 redundant places. [2022-01-19 05:47:08,699 INFO L242 Difference]: Finished difference. Result has 885 places, 1776 transitions, 27736 flow [2022-01-19 05:47:08,701 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=19810, PETRI_DIFFERENCE_MINUEND_PLACES=644, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=636, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=796, PETRI_DIFFERENCE_SUBTRAHEND_STATES=155, PETRI_FLOW=27736, PETRI_PLACES=885, PETRI_TRANSITIONS=1776} [2022-01-19 05:47:08,701 INFO L334 CegarLoopForPetriNet]: 140 programPoint places, 745 predicate places. [2022-01-19 05:47:08,702 INFO L470 AbstractCegarLoop]: Abstraction has has 885 places, 1776 transitions, 27736 flow [2022-01-19 05:47:08,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 118.35135135135135) internal successors, (4379), 37 states have internal predecessors, (4379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:47:08,702 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:47:08,702 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:47:08,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-01-19 05:47:08,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-01-19 05:47:08,921 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 05:47:08,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:47:08,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1777821501, now seen corresponding path program 1 times [2022-01-19 05:47:08,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:47:08,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797090422] [2022-01-19 05:47:08,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:47:08,922 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:47:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:47:09,013 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 05:47:09,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:47:09,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797090422] [2022-01-19 05:47:09,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797090422] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 05:47:09,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658333691] [2022-01-19 05:47:09,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:47:09,013 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:47:09,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 05:47:09,014 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 05:47:09,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-01-19 05:47:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:47:09,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-19 05:47:09,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 05:47:09,423 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:47:09,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 05:47:09,615 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:47:09,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658333691] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 05:47:09,616 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 05:47:09,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 34 [2022-01-19 05:47:09,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036281030] [2022-01-19 05:47:09,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 05:47:09,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-01-19 05:47:09,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:47:09,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-01-19 05:47:09,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=976, Unknown=0, NotChecked=0, Total=1122 [2022-01-19 05:47:09,618 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 166 [2022-01-19 05:47:09,620 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 885 places, 1776 transitions, 27736 flow. Second operand has 34 states, 34 states have (on average 118.47058823529412) internal successors, (4028), 34 states have internal predecessors, (4028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:47:09,620 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:47:09,620 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 166 [2022-01-19 05:47:09,620 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:47:29,966 INFO L129 PetriNetUnfolder]: 12719/42922 cut-off events. [2022-01-19 05:47:29,966 INFO L130 PetriNetUnfolder]: For 2919689/2928419 co-relation queries the response was YES. [2022-01-19 05:47:32,419 INFO L84 FinitePrefix]: Finished finitePrefix Result has 322854 conditions, 42922 events. 12719/42922 cut-off events. For 2919689/2928419 co-relation queries the response was YES. Maximal size of possible extension queue 1886. Compared 597325 event pairs, 2976 based on Foata normal form. 907/41316 useless extension candidates. Maximal degree in co-relation 322544. Up to 7355 conditions per place. [2022-01-19 05:47:32,646 INFO L132 encePairwiseOnDemand]: 149/166 looper letters, 1223 selfloop transitions, 894 changer transitions 182/2427 dead transitions. [2022-01-19 05:47:32,646 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 903 places, 2427 transitions, 44623 flow [2022-01-19 05:47:32,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-01-19 05:47:32,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2022-01-19 05:47:32,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 7796 transitions. [2022-01-19 05:47:32,650 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7454580225664563 [2022-01-19 05:47:32,650 INFO L72 ComplementDD]: Start complementDD. Operand 63 states and 7796 transitions. [2022-01-19 05:47:32,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 7796 transitions. [2022-01-19 05:47:32,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:47:32,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 63 states and 7796 transitions. [2022-01-19 05:47:32,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 64 states, 63 states have (on average 123.74603174603175) internal successors, (7796), 63 states have internal predecessors, (7796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:47:32,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 64 states, 64 states have (on average 166.0) internal successors, (10624), 64 states have internal predecessors, (10624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:47:32,660 INFO L81 ComplementDD]: Finished complementDD. Result has 64 states, 64 states have (on average 166.0) internal successors, (10624), 64 states have internal predecessors, (10624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:47:32,661 INFO L186 Difference]: Start difference. First operand has 885 places, 1776 transitions, 27736 flow. Second operand 63 states and 7796 transitions. [2022-01-19 05:47:32,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 903 places, 2427 transitions, 44623 flow [2022-01-19 05:47:49,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 836 places, 2427 transitions, 39724 flow, removed 1988 selfloop flow, removed 67 redundant places. [2022-01-19 05:47:49,174 INFO L242 Difference]: Finished difference. Result has 852 places, 1849 transitions, 28496 flow [2022-01-19 05:47:49,175 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=24958, PETRI_DIFFERENCE_MINUEND_PLACES=774, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1776, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=786, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=973, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=28496, PETRI_PLACES=852, PETRI_TRANSITIONS=1849} [2022-01-19 05:47:49,176 INFO L334 CegarLoopForPetriNet]: 140 programPoint places, 712 predicate places. [2022-01-19 05:47:49,176 INFO L470 AbstractCegarLoop]: Abstraction has has 852 places, 1849 transitions, 28496 flow [2022-01-19 05:47:49,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 118.47058823529412) internal successors, (4028), 34 states have internal predecessors, (4028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:47:49,176 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:47:49,177 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:47:49,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-01-19 05:47:49,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-01-19 05:47:49,392 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 05:47:49,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:47:49,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1576695771, now seen corresponding path program 2 times [2022-01-19 05:47:49,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:47:49,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375141556] [2022-01-19 05:47:49,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:47:49,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:47:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:47:49,528 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:47:49,528 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:47:49,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375141556] [2022-01-19 05:47:49,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375141556] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 05:47:49,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404025361] [2022-01-19 05:47:49,528 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 05:47:49,528 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:47:49,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 05:47:49,529 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 05:47:49,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-01-19 05:47:49,634 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 05:47:49,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 05:47:49,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-19 05:47:49,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 05:47:49,964 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:47:49,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 05:47:50,171 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:47:50,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404025361] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 05:47:50,172 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 05:47:50,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 34 [2022-01-19 05:47:50,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549418804] [2022-01-19 05:47:50,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 05:47:50,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-01-19 05:47:50,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:47:50,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-01-19 05:47:50,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=999, Unknown=0, NotChecked=0, Total=1122 [2022-01-19 05:47:50,174 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 166 [2022-01-19 05:47:50,176 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 852 places, 1849 transitions, 28496 flow. Second operand has 34 states, 34 states have (on average 118.47058823529412) internal successors, (4028), 34 states have internal predecessors, (4028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:47:50,176 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:47:50,176 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 166 [2022-01-19 05:47:50,176 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:48:12,700 INFO L129 PetriNetUnfolder]: 12641/43830 cut-off events. [2022-01-19 05:48:12,701 INFO L130 PetriNetUnfolder]: For 2537943/2547151 co-relation queries the response was YES. [2022-01-19 05:48:15,257 INFO L84 FinitePrefix]: Finished finitePrefix Result has 298958 conditions, 43830 events. 12641/43830 cut-off events. For 2537943/2547151 co-relation queries the response was YES. Maximal size of possible extension queue 1939. Compared 618886 event pairs, 1643 based on Foata normal form. 1674/43263 useless extension candidates. Maximal degree in co-relation 298677. Up to 2844 conditions per place. [2022-01-19 05:48:15,469 INFO L132 encePairwiseOnDemand]: 149/166 looper letters, 1185 selfloop transitions, 1491 changer transitions 478/3282 dead transitions. [2022-01-19 05:48:15,470 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 991 places, 3282 transitions, 60820 flow [2022-01-19 05:48:15,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2022-01-19 05:48:15,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2022-01-19 05:48:15,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 17868 transitions. [2022-01-19 05:48:15,478 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7372503713484073 [2022-01-19 05:48:15,478 INFO L72 ComplementDD]: Start complementDD. Operand 146 states and 17868 transitions. [2022-01-19 05:48:15,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 146 states and 17868 transitions. [2022-01-19 05:48:15,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:48:15,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 146 states and 17868 transitions. [2022-01-19 05:48:15,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 147 states, 146 states have (on average 122.38356164383562) internal successors, (17868), 146 states have internal predecessors, (17868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:48:15,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 147 states, 147 states have (on average 166.0) internal successors, (24402), 147 states have internal predecessors, (24402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:48:15,507 INFO L81 ComplementDD]: Finished complementDD. Result has 147 states, 147 states have (on average 166.0) internal successors, (24402), 147 states have internal predecessors, (24402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:48:15,507 INFO L186 Difference]: Start difference. First operand has 852 places, 1849 transitions, 28496 flow. Second operand 146 states and 17868 transitions. [2022-01-19 05:48:15,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 991 places, 3282 transitions, 60820 flow [2022-01-19 05:48:30,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 968 places, 3282 transitions, 59533 flow, removed 454 selfloop flow, removed 23 redundant places. [2022-01-19 05:48:30,574 INFO L242 Difference]: Finished difference. Result has 1034 places, 2177 transitions, 38490 flow [2022-01-19 05:48:30,575 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=27934, PETRI_DIFFERENCE_MINUEND_PLACES=823, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1849, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1096, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=711, PETRI_DIFFERENCE_SUBTRAHEND_STATES=146, PETRI_FLOW=38490, PETRI_PLACES=1034, PETRI_TRANSITIONS=2177} [2022-01-19 05:48:30,576 INFO L334 CegarLoopForPetriNet]: 140 programPoint places, 894 predicate places. [2022-01-19 05:48:30,576 INFO L470 AbstractCegarLoop]: Abstraction has has 1034 places, 2177 transitions, 38490 flow [2022-01-19 05:48:30,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 118.47058823529412) internal successors, (4028), 34 states have internal predecessors, (4028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:48:30,576 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:48:30,576 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:48:30,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-01-19 05:48:30,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:48:30,785 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 05:48:30,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:48:30,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1386087431, now seen corresponding path program 1 times [2022-01-19 05:48:30,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:48:30,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050057727] [2022-01-19 05:48:30,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:48:30,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:48:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:48:30,874 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:48:30,874 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:48:30,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050057727] [2022-01-19 05:48:30,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050057727] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 05:48:30,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709407122] [2022-01-19 05:48:30,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:48:30,875 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:48:30,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 05:48:30,876 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 05:48:30,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-01-19 05:48:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:48:30,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-19 05:48:30,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 05:48:31,294 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:48:31,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 05:48:31,500 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:48:31,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709407122] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 05:48:31,500 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 05:48:31,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 34 [2022-01-19 05:48:31,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381211883] [2022-01-19 05:48:31,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 05:48:31,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-01-19 05:48:31,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:48:31,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-01-19 05:48:31,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=986, Unknown=0, NotChecked=0, Total=1122 [2022-01-19 05:48:31,503 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 166 [2022-01-19 05:48:31,504 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1034 places, 2177 transitions, 38490 flow. Second operand has 34 states, 34 states have (on average 118.47058823529412) internal successors, (4028), 34 states have internal predecessors, (4028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:48:31,504 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:48:31,504 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 166 [2022-01-19 05:48:31,504 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:49:03,416 INFO L129 PetriNetUnfolder]: 15717/55358 cut-off events. [2022-01-19 05:49:03,416 INFO L130 PetriNetUnfolder]: For 4459875/4467010 co-relation queries the response was YES. [2022-01-19 05:49:07,535 INFO L84 FinitePrefix]: Finished finitePrefix Result has 412860 conditions, 55358 events. 15717/55358 cut-off events. For 4459875/4467010 co-relation queries the response was YES. Maximal size of possible extension queue 2310. Compared 803864 event pairs, 2707 based on Foata normal form. 1041/54098 useless extension candidates. Maximal degree in co-relation 412522. Up to 15111 conditions per place. [2022-01-19 05:49:07,788 INFO L132 encePairwiseOnDemand]: 149/166 looper letters, 1615 selfloop transitions, 643 changer transitions 920/3306 dead transitions. [2022-01-19 05:49:07,788 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1105 places, 3306 transitions, 69677 flow [2022-01-19 05:49:07,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-01-19 05:49:07,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2022-01-19 05:49:07,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 12656 transitions. [2022-01-19 05:49:07,793 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7402035325769096 [2022-01-19 05:49:07,793 INFO L72 ComplementDD]: Start complementDD. Operand 103 states and 12656 transitions. [2022-01-19 05:49:07,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 12656 transitions. [2022-01-19 05:49:07,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:49:07,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 103 states and 12656 transitions. [2022-01-19 05:49:07,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 104 states, 103 states have (on average 122.87378640776699) internal successors, (12656), 103 states have internal predecessors, (12656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:49:07,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 104 states, 104 states have (on average 166.0) internal successors, (17264), 104 states have internal predecessors, (17264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:49:07,810 INFO L81 ComplementDD]: Finished complementDD. Result has 104 states, 104 states have (on average 166.0) internal successors, (17264), 104 states have internal predecessors, (17264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:49:07,810 INFO L186 Difference]: Start difference. First operand has 1034 places, 2177 transitions, 38490 flow. Second operand 103 states and 12656 transitions. [2022-01-19 05:49:07,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1105 places, 3306 transitions, 69677 flow [2022-01-19 05:49:50,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1045 places, 3306 transitions, 64209 flow, removed 2440 selfloop flow, removed 60 redundant places. [2022-01-19 05:49:50,398 INFO L242 Difference]: Finished difference. Result has 1097 places, 2038 transitions, 36449 flow [2022-01-19 05:49:50,399 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=36162, PETRI_DIFFERENCE_MINUEND_PLACES=943, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=462, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1699, PETRI_DIFFERENCE_SUBTRAHEND_STATES=103, PETRI_FLOW=36449, PETRI_PLACES=1097, PETRI_TRANSITIONS=2038} [2022-01-19 05:49:50,400 INFO L334 CegarLoopForPetriNet]: 140 programPoint places, 957 predicate places. [2022-01-19 05:49:50,400 INFO L470 AbstractCegarLoop]: Abstraction has has 1097 places, 2038 transitions, 36449 flow [2022-01-19 05:49:50,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 118.47058823529412) internal successors, (4028), 34 states have internal predecessors, (4028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:49:50,401 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:49:50,401 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:49:50,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-01-19 05:49:50,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:49:50,602 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 05:49:50,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:49:50,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1243033295, now seen corresponding path program 1 times [2022-01-19 05:49:50,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:49:50,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685779066] [2022-01-19 05:49:50,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:49:50,603 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:49:50,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:49:50,692 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 05:49:50,692 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:49:50,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685779066] [2022-01-19 05:49:50,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685779066] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 05:49:50,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050224586] [2022-01-19 05:49:50,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:49:50,693 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:49:50,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 05:49:50,696 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 05:49:50,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-01-19 05:49:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:49:50,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-19 05:49:50,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 05:49:51,106 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:49:51,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 05:49:51,315 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:49:51,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050224586] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 05:49:51,315 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 05:49:51,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 34 [2022-01-19 05:49:51,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113776867] [2022-01-19 05:49:51,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 05:49:51,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-01-19 05:49:51,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:49:51,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-01-19 05:49:51,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=976, Unknown=0, NotChecked=0, Total=1122 [2022-01-19 05:49:51,318 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 166 [2022-01-19 05:49:51,319 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1097 places, 2038 transitions, 36449 flow. Second operand has 34 states, 34 states have (on average 118.47058823529412) internal successors, (4028), 34 states have internal predecessors, (4028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:49:51,319 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:49:51,319 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 166 [2022-01-19 05:49:51,319 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:50:20,629 INFO L129 PetriNetUnfolder]: 14914/53259 cut-off events. [2022-01-19 05:50:20,629 INFO L130 PetriNetUnfolder]: For 4939116/4946336 co-relation queries the response was YES. [2022-01-19 05:50:25,014 INFO L84 FinitePrefix]: Finished finitePrefix Result has 392755 conditions, 53259 events. 14914/53259 cut-off events. For 4939116/4946336 co-relation queries the response was YES. Maximal size of possible extension queue 2098. Compared 770187 event pairs, 3267 based on Foata normal form. 932/51949 useless extension candidates. Maximal degree in co-relation 392447. Up to 15111 conditions per place. [2022-01-19 05:50:25,247 INFO L132 encePairwiseOnDemand]: 149/166 looper letters, 1617 selfloop transitions, 402 changer transitions 475/2622 dead transitions. [2022-01-19 05:50:25,248 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1104 places, 2622 transitions, 55109 flow [2022-01-19 05:50:25,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-01-19 05:50:25,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2022-01-19 05:50:25,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 7158 transitions. [2022-01-19 05:50:25,251 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7434565849605318 [2022-01-19 05:50:25,251 INFO L72 ComplementDD]: Start complementDD. Operand 58 states and 7158 transitions. [2022-01-19 05:50:25,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 7158 transitions. [2022-01-19 05:50:25,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:50:25,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 58 states and 7158 transitions. [2022-01-19 05:50:25,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 59 states, 58 states have (on average 123.41379310344827) internal successors, (7158), 58 states have internal predecessors, (7158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:50:25,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 59 states, 59 states have (on average 166.0) internal successors, (9794), 59 states have internal predecessors, (9794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:50:25,260 INFO L81 ComplementDD]: Finished complementDD. Result has 59 states, 59 states have (on average 166.0) internal successors, (9794), 59 states have internal predecessors, (9794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:50:25,260 INFO L186 Difference]: Start difference. First operand has 1097 places, 2038 transitions, 36449 flow. Second operand 58 states and 7158 transitions. [2022-01-19 05:50:25,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1104 places, 2622 transitions, 55109 flow [2022-01-19 05:51:04,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1047 places, 2622 transitions, 46438 flow, removed 3430 selfloop flow, removed 57 redundant places. [2022-01-19 05:51:04,581 INFO L242 Difference]: Finished difference. Result has 1066 places, 1897 transitions, 30353 flow [2022-01-19 05:51:04,583 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=31463, PETRI_DIFFERENCE_MINUEND_PLACES=990, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2038, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=324, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1689, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=30353, PETRI_PLACES=1066, PETRI_TRANSITIONS=1897} [2022-01-19 05:51:04,584 INFO L334 CegarLoopForPetriNet]: 140 programPoint places, 926 predicate places. [2022-01-19 05:51:04,584 INFO L470 AbstractCegarLoop]: Abstraction has has 1066 places, 1897 transitions, 30353 flow [2022-01-19 05:51:04,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 118.47058823529412) internal successors, (4028), 34 states have internal predecessors, (4028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:51:04,584 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:51:04,584 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:51:04,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-01-19 05:51:04,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:51:04,799 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 05:51:04,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:51:04,800 INFO L85 PathProgramCache]: Analyzing trace with hash 494136340, now seen corresponding path program 1 times [2022-01-19 05:51:04,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:51:04,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127113526] [2022-01-19 05:51:04,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:51:04,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:51:04,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:51:04,926 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:51:04,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:51:04,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127113526] [2022-01-19 05:51:04,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127113526] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 05:51:04,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588022890] [2022-01-19 05:51:04,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:51:04,927 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:51:04,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 05:51:04,928 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 05:51:04,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-01-19 05:51:05,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:51:05,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-19 05:51:05,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 05:51:05,400 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:51:05,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 05:51:05,610 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:51:05,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588022890] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 05:51:05,610 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 05:51:05,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 39 [2022-01-19 05:51:05,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539813360] [2022-01-19 05:51:05,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 05:51:05,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-01-19 05:51:05,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:51:05,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-01-19 05:51:05,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1315, Unknown=0, NotChecked=0, Total=1482 [2022-01-19 05:51:05,613 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 166 [2022-01-19 05:51:05,615 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1066 places, 1897 transitions, 30353 flow. Second operand has 39 states, 39 states have (on average 117.28205128205128) internal successors, (4574), 39 states have internal predecessors, (4574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:51:05,615 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:51:05,615 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 166 [2022-01-19 05:51:05,615 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:51:31,684 INFO L129 PetriNetUnfolder]: 13735/47045 cut-off events. [2022-01-19 05:51:31,684 INFO L130 PetriNetUnfolder]: For 3044777/3051966 co-relation queries the response was YES. [2022-01-19 05:51:35,456 INFO L84 FinitePrefix]: Finished finitePrefix Result has 302411 conditions, 47045 events. 13735/47045 cut-off events. For 3044777/3051966 co-relation queries the response was YES. Maximal size of possible extension queue 1903. Compared 659562 event pairs, 2623 based on Foata normal form. 946/45963 useless extension candidates. Maximal degree in co-relation 302115. Up to 12853 conditions per place. [2022-01-19 05:51:35,667 INFO L132 encePairwiseOnDemand]: 148/166 looper letters, 1580 selfloop transitions, 548 changer transitions 249/2504 dead transitions. [2022-01-19 05:51:35,667 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1142 places, 2504 transitions, 45434 flow [2022-01-19 05:51:35,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-01-19 05:51:35,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2022-01-19 05:51:35,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 12505 transitions. [2022-01-19 05:51:35,672 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7313720903029595 [2022-01-19 05:51:35,672 INFO L72 ComplementDD]: Start complementDD. Operand 103 states and 12505 transitions. [2022-01-19 05:51:35,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 12505 transitions. [2022-01-19 05:51:35,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:51:35,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 103 states and 12505 transitions. [2022-01-19 05:51:35,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 104 states, 103 states have (on average 121.40776699029126) internal successors, (12505), 103 states have internal predecessors, (12505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:51:35,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 104 states, 104 states have (on average 166.0) internal successors, (17264), 104 states have internal predecessors, (17264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:51:35,689 INFO L81 ComplementDD]: Finished complementDD. Result has 104 states, 104 states have (on average 166.0) internal successors, (17264), 104 states have internal predecessors, (17264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:51:35,689 INFO L186 Difference]: Start difference. First operand has 1066 places, 1897 transitions, 30353 flow. Second operand 103 states and 12505 transitions. [2022-01-19 05:51:35,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1142 places, 2504 transitions, 45434 flow [2022-01-19 05:51:55,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1095 places, 2504 transitions, 43812 flow, removed 443 selfloop flow, removed 47 redundant places. [2022-01-19 05:51:55,705 INFO L242 Difference]: Finished difference. Result has 1116 places, 1908 transitions, 29698 flow [2022-01-19 05:51:55,707 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=29027, PETRI_DIFFERENCE_MINUEND_PLACES=993, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1897, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=485, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=103, PETRI_FLOW=29698, PETRI_PLACES=1116, PETRI_TRANSITIONS=1908} [2022-01-19 05:51:55,707 INFO L334 CegarLoopForPetriNet]: 140 programPoint places, 976 predicate places. [2022-01-19 05:51:55,708 INFO L470 AbstractCegarLoop]: Abstraction has has 1116 places, 1908 transitions, 29698 flow [2022-01-19 05:51:55,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 117.28205128205128) internal successors, (4574), 39 states have internal predecessors, (4574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:51:55,708 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:51:55,708 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:51:55,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-01-19 05:51:55,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:51:55,923 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 05:51:55,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:51:55,924 INFO L85 PathProgramCache]: Analyzing trace with hash 480837700, now seen corresponding path program 2 times [2022-01-19 05:51:55,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:51:55,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936282421] [2022-01-19 05:51:55,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:51:55,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:51:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:51:56,048 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:51:56,049 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:51:56,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936282421] [2022-01-19 05:51:56,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936282421] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 05:51:56,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018690393] [2022-01-19 05:51:56,049 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 05:51:56,049 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:51:56,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 05:51:56,050 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 05:51:56,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-01-19 05:51:56,123 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-19 05:51:56,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 05:51:56,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-19 05:51:56,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 05:51:56,646 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-19 05:51:56,646 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 05:51:56,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018690393] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:51:56,647 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 05:51:56,647 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [17] total 29 [2022-01-19 05:51:56,647 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730785252] [2022-01-19 05:51:56,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:51:56,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-19 05:51:56,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:51:56,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-19 05:51:56,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2022-01-19 05:51:56,648 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 166 [2022-01-19 05:51:56,649 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1116 places, 1908 transitions, 29698 flow. Second operand has 14 states, 14 states have (on average 118.07142857142857) internal successors, (1653), 14 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:51:56,649 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:51:56,649 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 166 [2022-01-19 05:51:56,649 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:52:02,757 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([575] L703-->L702-2: Formula: (= (+ |v_thr2Thread3of3ForFork0_~t~0#1_5| 1) v_~x~0_2) InVars {thr2Thread3of3ForFork0_~t~0#1=|v_thr2Thread3of3ForFork0_~t~0#1_5|} OutVars{~x~0=v_~x~0_2, thr2Thread3of3ForFork0_~t~0#1=|v_thr2Thread3of3ForFork0_~t~0#1_5|} AuxVars[] AssignedVars[~x~0][704], [Black: 9709#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 9631#(and (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 2 ~n~0)), Black: 9685#(and (<= ~x~0 2) (< 2 ~n~0) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 9683#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 9661#(and (<= ~x~0 2) (< 2 ~n~0) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 9673#(and (<= ~x~0 2) (< 2 ~n~0) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|)), Black: 9695#(and (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= (+ 2 |thr2Thread2of3ForFork0_~t~0#1|) ~n~0)), Black: 9707#(and (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= 2 ~n~0)), Black: 9697#(and (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= 2 ~n~0)), Black: 9687#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|)), Black: 9671#(and (<= ~x~0 2) (< 2 ~n~0) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 9691#(and (<= ~x~0 2) (< 2 ~n~0) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 9667#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 9719#(and (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 9693#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 9657#(and (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= 2 ~n~0)), Black: 9723#(and (< 2 ~n~0) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 9703#(and (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= (+ 2 |thr2Thread2of3ForFork0_~t~0#1|) ~n~0)), 112#thr1ENTRYtrue, Black: 9659#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 9629#(and (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= 2 ~n~0)), Black: 9655#(and (<= ~x~0 2) (< 2 ~n~0) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 9731#(and (< 2 ~n~0) (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 9701#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 9715#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 9627#(and (<= ~x~0 2) (< 2 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 9603#(and (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 9679#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 9711#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 9623#(and (<= ~x~0 2) (< 2 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|)), Black: 9689#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 9721#(and (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), 10513#(and (< 2 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0)), 4502#true, Black: 9677#(and (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 9705#(and (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= 2 ~n~0)), Black: 9699#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= 2 ~n~0)), Black: 9713#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 9681#(and (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 9647#(and (<= ~x~0 2) (< 2 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 9663#(and (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= 2 ~n~0)), Black: 9633#(and (< 2 ~n~0) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= 2 |ULTIMATE.start_main_~i~0#1|)), 98#L698true, 235#true, Black: 2063#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 2059#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= ~x~0 1) (<= 2 ~n~0)), Black: 2025#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 2041#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 2023#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0)), Black: 2035#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 2073#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= 2 ~n~0)), Black: 2069#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0) (<= (+ ~x~0 1) ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= 2 ~n~0)), Black: 2061#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 2113#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 2 ~n~0)), Black: 2125#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= 2 ~n~0)), Black: 2043#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= 2 ~n~0)), Black: 2131#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 2037#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= 2 ~n~0)), Black: 2077#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= 2 ~n~0)), Black: 2079#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0) (<= 2 ~n~0)), Black: 8739#(and (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0) (<= (+ 2 |thr2Thread1of3ForFork0_~t~0#1|) ~n~0) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| |ULTIMATE.start_main_#t~post8#1|)), Black: 2119#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= 2 ~n~0)), Black: 8779#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0) (<= (+ 2 |thr2Thread1of3ForFork0_~t~0#1|) ~n~0) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0)), Black: 8577#(and (= ~x~0 0) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 2 ~n~0)), Black: 5133#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0) (<= 2 ~n~0)), Black: 8633#(and (< 2 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1)), Black: 5101#(and (= ~x~0 0) (<= (+ ~x~0 1) ~n~0)), Black: 8603#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= 1 |ULTIMATE.start_main_#t~post8#1|) (<= 2 ~n~0)), Black: 8701#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= ~x~0 1) (<= 2 ~n~0)), Black: 8671#(and (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ 2 |thr2Thread1of3ForFork0_~t~0#1|) ~n~0) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 5159#(and (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0)), Black: 5143#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 8627#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 8695#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= ~x~0 1) (<= 1 |ULTIMATE.start_main_#t~post8#1|) (<= 2 ~n~0)), Black: 8727#(and (<= ~x~0 2) (< 2 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_#t~post8#1|)), Black: 5151#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= 2 ~n~0)), Black: 5181#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0) (<= 2 ~n~0)), Black: 8657#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ 2 |thr2Thread1of3ForFork0_~t~0#1|) ~n~0) (<= 1 |ULTIMATE.start_main_#t~post8#1|)), Black: 8785#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= 2 ~n~0)), Black: 5111#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_#t~post8#1| 0) (<= ~x~0 ~n~0)), Black: 8647#(and (< 2 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= 1 |ULTIMATE.start_main_#t~post8#1|)), Black: 5171#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0) (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= 2 ~n~0)), Black: 8607#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ 2 |thr2Thread1of3ForFork0_~t~0#1|) ~n~0) (<= ~x~0 1) (<= 1 |ULTIMATE.start_main_#t~post8#1|)), Black: 8599#(and (= ~x~0 0) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_#t~post8#1|) (<= 2 ~n~0)), Black: 5131#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= 2 ~n~0)), Black: 8777#(and (<= |thr2Thread1of3ForFork0_~t~0#1| |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0)), thr2Thread1of3ForFork0InUse, Black: 8617#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 (+ |ULTIMATE.start_main_#t~post8#1| 1)) (<= (+ ~x~0 1) ~n~0) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ 2 |thr2Thread1of3ForFork0_~t~0#1|) ~n~0) (<= ~x~0 1) (<= |thr2Thread1of3ForFork0_~t~0#1| |ULTIMATE.start_main_#t~post8#1|)), Black: 5153#(and (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0) (<= 0 |ULTIMATE.start_main_~i~0#1|)), Black: 8645#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= 1 |ULTIMATE.start_main_#t~post8#1|)), thr2Thread2of3ForFork0InUse, Black: 8791#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= 1 |ULTIMATE.start_main_#t~post8#1|) (<= 2 ~n~0)), Black: 8715#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 5149#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= 2 ~n~0)), thr2Thread3of3ForFork0InUse, Black: 8613#(and (= ~x~0 0) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 2 ~n~0)), Black: 5177#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= 2 ~n~0)), thr1Thread1of3ForFork1InUse, Black: 8723#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_#t~post8#1|)), Black: 5175#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= 2 ~n~0)), Black: 8631#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1)), Black: 8817#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= 2 ~n~0)), Black: 5145#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= 2 ~n~0)), Black: 8729#(and (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0) (<= (+ 2 |thr2Thread1of3ForFork0_~t~0#1|) ~n~0) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0)), Black: 5129#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 8597#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ 2 |thr2Thread1of3ForFork0_~t~0#1|) ~n~0) (<= ~x~0 1)), Black: 8717#(and (<= ~x~0 2) (< 2 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 5127#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0)), Black: 8669#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 2 ~n~0)), Black: 5125#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0)), Black: 8757#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= 2 ~n~0)), Black: 8593#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 3593#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (< 1 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0)), Black: 8699#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= ~x~0 1) (<= 2 ~n~0)), Black: 3705#(and (<= ~x~0 2) (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1)), Black: 3623#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= 2 ~n~0)), Black: 8655#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_#t~post8#1|) (<= 2 ~n~0)), Black: 2932#(<= ~x~0 ~n~0), Black: 8721#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= 1 |ULTIMATE.start_main_#t~post8#1|) (<= 2 ~n~0)), Black: 3567#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 8649#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 2 ~n~0)), Black: 8653#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0)), Black: 3571#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0)), Black: 8629#(and (<= (+ ~x~0 1) ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ 2 |thr2Thread1of3ForFork0_~t~0#1|) ~n~0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1)), Black: 3549#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0)), Black: 3555#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0) (<= 2 ~n~0)), Black: 3533#(and (= ~x~0 0) (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= (+ ~x~0 1) ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|)), Black: 178#(and (= ~x~0 0) (not (<= 10 ~n~0)) (<= 5 ~n~0)), Black: 3607#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (< 1 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|)), Black: 7829#(and (<= ~x~0 2) (< 2 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 1) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|)), Black: 3575#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= 2 ~n~0)), Black: 7831#(and (<= ~x~0 2) (< 2 ~n~0) (<= (+ 2 ~x~0) ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 1) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|)), Black: 7851#(and (<= ~x~0 2) (< 2 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0)), Black: 7809#(and (<= ~x~0 2) (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| 1)), Black: 3681#(and (<= ~x~0 2) (<= 1 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1)), Black: 7827#(and (<= ~x~0 2) (< 2 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 1) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|)), Black: 3539#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (= |ULTIMATE.start_main_#t~post8#1| 0) (<= ~x~0 ~n~0)), Black: 3140#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| 0)), Black: 7821#(and (<= ~x~0 2) (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|)), Black: 3595#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0)), Black: 7825#(and (<= ~x~0 2) (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 (+ |ULTIMATE.start_main_#t~post8#1| 1)) (<= |thr2Thread1of3ForFork0_~t~0#1| 1)), Black: 3569#(and (= ~x~0 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0)), Black: 7785#(and (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) ~n~0) (<= ~x~0 ~n~0)), Black: 3653#(and (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0) (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0)), Black: 7859#(and (< 2 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 1) (<= (+ ~x~0 1) ~n~0) (<= (+ 2 |thr2Thread3of3ForFork0_~t~0#1|) ~n~0)), Black: 3713#(and (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0) (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0)), Black: 7861#(and (<= ~x~0 2) (< 2 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 1) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (= |thr2Thread3of3ForFork0_~t~0#1| 0)), Black: 3585#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0)), Black: 3553#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= 2 ~n~0)), Black: 3573#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 3603#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1)), Black: 3133#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| 0)), Black: 214#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0) (<= 1 ~n~0)), Black: 3587#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0)), Black: 200#(and (= ~x~0 0) (= |ULTIMATE.start_main_~i~0#1| 0)), 5301#true, Black: 210#(and (= ~x~0 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 ~n~0)), Black: 3605#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 1)), Black: 3639#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0) (<= 2 ~n~0)), Black: 3683#(and (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0)), Black: 3547#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0)), Black: 212#(and (= ~x~0 0) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 ~n~0)), Black: 3721#(and (<= ~x~0 2) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1)), 7817#(and (< 2 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0)), Black: 3723#(and (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0)), Black: 3591#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 1)), 2922#true, Black: 3551#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 736#(and (= ~x~0 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 ~n~0)), Black: 746#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (< 1 ~n~0) (<= ~x~0 1)), Black: 762#(and (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (< 1 ~n~0) (<= ~x~0 1)), Black: 768#(and (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (< 1 ~n~0) (<= ~x~0 1) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 11407#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 3 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1)), Black: 11413#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 3 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_#t~post8#1|) (<= (+ 2 ~x~0) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1)), Black: 11495#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 3) (<= 3 ~n~0) (<= |thr2Thread3of3ForFork0_~t~0#1| 2)), Black: 11527#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= ~x~0 3) (<= 3 ~n~0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= |thr2Thread3of3ForFork0_~t~0#1| 2)), Black: 11411#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 3 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1)), 58#L713-7true, Black: 11535#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= ~x~0 3) (<= 3 ~n~0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= |thr2Thread3of3ForFork0_~t~0#1| 2) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 11391#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 3 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1)), Black: 11517#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 3) (<= 3 ~n~0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= |thr2Thread3of3ForFork0_~t~0#1| 2)), Black: 11429#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 3 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= ~x~0 1)), Black: 11431#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 3 ~n~0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1)), Black: 11539#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 3) (<= 3 ~n~0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= |thr2Thread3of3ForFork0_~t~0#1| 2)), Black: 11537#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 3) (<= 3 ~n~0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= |thr2Thread3of3ForFork0_~t~0#1| 2)), Black: 11531#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 3 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= |thr2Thread3of3ForFork0_~t~0#1| 2)), Black: 11393#(and (<= ~x~0 2) (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1)), Black: 11541#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 3) (<= 3 ~n~0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= |thr2Thread3of3ForFork0_~t~0#1| 2) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 11511#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 3 ~n~0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= |thr2Thread3of3ForFork0_~t~0#1| 2)), Black: 11465#(and (<= ~x~0 2) (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= |thr2Thread3of3ForFork0_~t~0#1| 2)), Black: 11493#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 3 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1)), Black: 11423#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 3 ~n~0) (<= (+ 2 ~x~0) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= (+ 3 ~x~0) ~n~0)), Black: 11419#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 3 ~n~0) (<= (+ 2 ~x~0) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1)), Black: 11471#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 3) (<= 3 ~n~0) (<= |thr2Thread3of3ForFork0_~t~0#1| 2)), 6816#(and (<= ~x~0 2) (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 10545#(and (<= ~x~0 2) (< 2 ~n~0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0)), Black: 10527#(and (<= ~x~0 2) (< 2 ~n~0) (<= (+ 2 ~x~0) ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1)), Black: 10523#(and (<= ~x~0 2) (< 2 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|)), Black: 10499#(and (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0) (<= ~x~0 ~n~0)), Black: 2861#(and (<= (+ 2 ~x~0) ~n~0) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= |thr2Thread1of3ForFork0_~t~0#1| 1) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 10517#(and (<= ~x~0 2) (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|)), Black: 2807#(and (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) ~n~0) (<= ~x~0 ~n~0)), Black: 10551#(and (<= ~x~0 2) (< 2 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0)), Black: 2853#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= |thr2Thread1of3ForFork0_~t~0#1| 1) (<= ~x~0 1) (<= 2 ~n~0)), Black: 10521#(and (<= ~x~0 2) (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 (+ |ULTIMATE.start_main_#t~post8#1| 1)) (<= |thr2Thread2of3ForFork0_~t~0#1| 1)), Black: 2869#(and (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) ~n~0) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 1) (<= 2 ~n~0)), Black: 10559#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 10547#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0)), Black: 2831#(and (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 10505#(and (<= ~x~0 2) (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1)), Black: 2857#(and (<= ~x~0 2) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= |thr2Thread1of3ForFork0_~t~0#1| 1) (<= 2 ~n~0)), 1406#true, Black: 10519#(and (< 2 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0)), Black: 10549#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 2827#(and (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 1) (<= 2 ~n~0)), Black: 10525#(and (<= ~x~0 2) (< 2 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1)), Black: 2851#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= |thr2Thread1of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 10557#(and (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= (+ ~x~0 1) ~n~0) (<= (+ 2 |thr2Thread3of3ForFork0_~t~0#1|) ~n~0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1)), Black: 2865#(and (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= |thr2Thread1of3ForFork0_~t~0#1| 1) (<= ~x~0 1) (<= 2 ~n~0)), Black: 2821#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 1) (<= 2 ~n~0)), Black: 10555#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0)), Black: 10553#(and (< 2 ~n~0) (<= (+ ~x~0 1) ~n~0) (<= (+ 2 |thr2Thread3of3ForFork0_~t~0#1|) ~n~0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1)), Black: 2849#(and (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= |thr2Thread1of3ForFork0_~t~0#1| 1) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 2825#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 2837#(and (<= (+ 2 ~x~0) ~n~0) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 2855#(and (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= |thr2Thread1of3ForFork0_~t~0#1| 1) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 2877#(and (<= ~x~0 2) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= |thr2Thread1of3ForFork0_~t~0#1| 1) (<= 2 ~n~0)), Black: 2829#(and (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 6894#(and (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= (+ ~x~0 1) ~n~0) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ 2 |thr2Thread3of3ForFork0_~t~0#1|) ~n~0)), Black: 1372#(and (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 6782#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| |ULTIMATE.start_main_#t~post8#1|)), Black: 6796#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) ~n~0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1)), Black: 6800#(and (<= (+ ~x~0 1) ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|)), Black: 1378#(and (< 2 ~n~0) (<= ~x~0 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0)), Black: 6776#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) ~n~0) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= 1 |ULTIMATE.start_main_#t~post8#1|)), Black: 6890#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 1368#(and (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 (+ |ULTIMATE.start_main_#t~post8#1| 1)) (<= ~x~0 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0)), Black: 6758#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|)), Black: 1354#(and (= ~x~0 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 1 ~n~0)), Black: 1374#(and (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 (+ |ULTIMATE.start_main_#t~post8#1| 1)) (<= ~x~0 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 6808#(and (<= (+ 2 ~x~0) ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1)), Black: 6876#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 1370#(and (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 (+ |ULTIMATE.start_main_#t~post8#1| 1)) (<= ~x~0 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0)), Black: 6940#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 1366#(and (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0)), Black: 1350#(and (= ~x~0 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_#t~post8#1|) (<= 1 ~n~0)), Black: 6900#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_#t~post8#1|)), Black: 6832#(and (<= ~x~0 2) (< 2 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 6806#(and (<= (+ 2 ~x~0) ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|)), Black: 6896#(and (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| |ULTIMATE.start_main_#t~post8#1|)), Black: 6886#(and (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0)), Black: 6916#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 6864#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| |ULTIMATE.start_main_#t~post8#1|)), Black: 6932#(and (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 6824#(and (<= (+ 2 ~x~0) ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| |ULTIMATE.start_main_#t~post8#1|)), Black: 4461#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1)), Black: 6892#(and (<= (+ ~x~0 1) ~n~0) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ 2 |thr2Thread3of3ForFork0_~t~0#1|) ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| |ULTIMATE.start_main_#t~post8#1|)), Black: 6946#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0)), Black: 4451#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= ~x~0 1)), Black: 6934#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 4457#(and (<= ~x~0 2) (< 1 ~n~0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1)), Black: 6924#(and (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= (+ ~x~0 1) ~n~0) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ 2 |thr2Thread3of3ForFork0_~t~0#1|) ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 6792#(and (<= (+ ~x~0 1) ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| |ULTIMATE.start_main_#t~post8#1|)), Black: 4467#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1)), Black: 4465#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= ~x~0 1)), 124#L686-1true, Black: 4463#(and (<= ~x~0 2) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1)), Black: 6866#(and (<= (+ ~x~0 1) ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0)), Black: 6754#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|)), Black: 6802#(and (<= (+ ~x~0 1) ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1)), Black: 6021#(and (<= ~x~0 2) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 5 ~n~0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= |thr2Thread1of3ForFork0_~k~0#1| 10) (<= 5 |thr2Thread1of3ForFork0_~k~0#1|)), Black: 6784#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1) (<= |thr2Thread1of3ForFork0_~t~0#1| |ULTIMATE.start_main_#t~post8#1|)), Black: 5959#(and (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 5 ~n~0) (<= ~x~0 1) (<= |thr2Thread1of3ForFork0_~k~0#1| 10) (<= 5 |thr2Thread1of3ForFork0_~k~0#1|)), Black: 6854#(and (<= ~x~0 2) (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| |ULTIMATE.start_main_#t~post8#1|)), Black: 6838#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_#t~post8#1|)), Black: 5969#(and (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0) (<= ~x~0 ~n~0)), Black: 6922#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 6001#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 5 ~n~0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= ~x~0 1) (<= |thr2Thread1of3ForFork0_~k~0#1| 10) (<= 5 |thr2Thread1of3ForFork0_~k~0#1|)), Black: 6960#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 5989#(and (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0)), Black: 5730#(or (<= (+ 2 ~x~0) |thr2Thread1of3ForFork0_~k~0#1|) (= 0 |thr2Thread1of3ForFork0_assume_abort_if_not_~cond#1|)), Black: 5961#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 5 ~n~0) (<= ~x~0 1) (<= |thr2Thread1of3ForFork0_~k~0#1| 10) (<= 5 |thr2Thread1of3ForFork0_~k~0#1|)), Black: 6772#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| |ULTIMATE.start_main_#t~post8#1|)), Black: 6826#(and (<= (+ 2 ~x~0) ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1) (<= |thr2Thread1of3ForFork0_~t~0#1| |ULTIMATE.start_main_#t~post8#1|)), Black: 6009#(and (<= ~x~0 2) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 5 ~n~0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= |thr2Thread1of3ForFork0_~k~0#1| 10) (<= 5 |thr2Thread1of3ForFork0_~k~0#1|)), Black: 5310#(<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0), Black: 6986#(and (< 2 ~n~0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= |thr2Thread1of3ForFork0_~t~0#1| |ULTIMATE.start_main_#t~post8#1|)), Black: 6882#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_#t~post8#1|)), Black: 6906#(and (< 2 ~n~0) (<= ~x~0 (+ |ULTIMATE.start_main_#t~post8#1| 1)) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= |thr2Thread1of3ForFork0_~t~0#1| |ULTIMATE.start_main_#t~post8#1|)), Black: 6930#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= (+ 2 ~x~0) ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 6884#(and (<= (+ ~x~0 1) ~n~0) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ 2 |thr2Thread3of3ForFork0_~t~0#1|) ~n~0)), Black: 6820#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= 1 |ULTIMATE.start_main_#t~post8#1|)), Black: 6798#(and (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|)), Black: 6908#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_#t~post8#1|)), Black: 6804#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1)), Black: 6904#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_#t~post8#1|)), Black: 6822#(and (<= ~x~0 2) (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|)), Black: 6944#(and (<= (+ ~x~0 1) ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ 2 |thr2Thread3of3ForFork0_~t~0#1|) ~n~0)), Black: 6874#(and (<= ~x~0 2) (< 2 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), 11968#(and (<= ~x~0 3) (<= 5 ~n~0) (<= |thr2Thread3of3ForFork0_~t~0#1| 2) (< ~n~0 10)), 11403#(and (< 2 ~n~0) (<= ~x~0 3) (<= |thr2Thread3of3ForFork0_~t~0#1| 2)), 3832#true, 159#L702-2true, 8639#(and (<= ~x~0 ~n~0) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0))]) [2022-01-19 05:52:02,758 INFO L384 tUnfolder$Statistics]: this new event has 99 ancestors and is not cut-off event [2022-01-19 05:52:02,758 INFO L387 tUnfolder$Statistics]: existing Event has 99 ancestors and is not cut-off event [2022-01-19 05:52:02,758 INFO L387 tUnfolder$Statistics]: existing Event has 99 ancestors and is not cut-off event [2022-01-19 05:52:02,759 INFO L387 tUnfolder$Statistics]: existing Event has 99 ancestors and is not cut-off event [2022-01-19 05:52:15,303 INFO L129 PetriNetUnfolder]: 9882/39083 cut-off events. [2022-01-19 05:52:15,304 INFO L130 PetriNetUnfolder]: For 2055888/2059615 co-relation queries the response was YES. [2022-01-19 05:52:18,513 INFO L84 FinitePrefix]: Finished finitePrefix Result has 232025 conditions, 39083 events. 9882/39083 cut-off events. For 2055888/2059615 co-relation queries the response was YES. Maximal size of possible extension queue 1638. Compared 562486 event pairs, 1686 based on Foata normal form. 421/36990 useless extension candidates. Maximal degree in co-relation 231722. Up to 3756 conditions per place. [2022-01-19 05:52:18,675 INFO L132 encePairwiseOnDemand]: 153/166 looper letters, 483 selfloop transitions, 765 changer transitions 128/2061 dead transitions. [2022-01-19 05:52:18,675 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1121 places, 2061 transitions, 36132 flow [2022-01-19 05:52:18,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-19 05:52:18,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-01-19 05:52:18,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 3539 transitions. [2022-01-19 05:52:18,677 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.735147486497715 [2022-01-19 05:52:18,677 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 3539 transitions. [2022-01-19 05:52:18,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 3539 transitions. [2022-01-19 05:52:18,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:52:18,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 3539 transitions. [2022-01-19 05:52:18,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 122.03448275862068) internal successors, (3539), 29 states have internal predecessors, (3539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:52:18,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 166.0) internal successors, (4980), 30 states have internal predecessors, (4980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:52:18,682 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 166.0) internal successors, (4980), 30 states have internal predecessors, (4980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:52:18,682 INFO L186 Difference]: Start difference. First operand has 1116 places, 1908 transitions, 29698 flow. Second operand 29 states and 3539 transitions. [2022-01-19 05:52:18,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1121 places, 2061 transitions, 36132 flow [2022-01-19 05:52:32,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1065 places, 2061 transitions, 35140 flow, removed 94 selfloop flow, removed 56 redundant places. [2022-01-19 05:52:32,130 INFO L242 Difference]: Finished difference. Result has 1068 places, 1825 transitions, 29016 flow [2022-01-19 05:52:32,131 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=28774, PETRI_DIFFERENCE_MINUEND_PLACES=1037, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1908, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=765, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=29016, PETRI_PLACES=1068, PETRI_TRANSITIONS=1825} [2022-01-19 05:52:32,132 INFO L334 CegarLoopForPetriNet]: 140 programPoint places, 928 predicate places. [2022-01-19 05:52:32,132 INFO L470 AbstractCegarLoop]: Abstraction has has 1068 places, 1825 transitions, 29016 flow [2022-01-19 05:52:32,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 118.07142857142857) internal successors, (1653), 14 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:52:32,132 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:52:32,132 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:52:32,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-01-19 05:52:32,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:52:32,333 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 05:52:32,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:52:32,333 INFO L85 PathProgramCache]: Analyzing trace with hash -941698414, now seen corresponding path program 1 times [2022-01-19 05:52:32,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:52:32,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346976153] [2022-01-19 05:52:32,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:52:32,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:52:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:52:32,457 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:52:32,457 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:52:32,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346976153] [2022-01-19 05:52:32,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346976153] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 05:52:32,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556568190] [2022-01-19 05:52:32,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:52:32,458 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:52:32,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 05:52:32,458 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 05:52:32,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-01-19 05:52:32,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:52:32,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-19 05:52:32,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 05:52:32,942 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:52:32,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 05:52:33,157 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:52:33,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556568190] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 05:52:33,157 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 05:52:33,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 39 [2022-01-19 05:52:33,158 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674081638] [2022-01-19 05:52:33,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 05:52:33,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-01-19 05:52:33,158 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:52:33,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-01-19 05:52:33,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1315, Unknown=0, NotChecked=0, Total=1482 [2022-01-19 05:52:33,160 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 166 [2022-01-19 05:52:33,162 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1068 places, 1825 transitions, 29016 flow. Second operand has 39 states, 39 states have (on average 117.28205128205128) internal successors, (4574), 39 states have internal predecessors, (4574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:52:33,162 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:52:33,162 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 166 [2022-01-19 05:52:33,162 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:52:54,905 INFO L129 PetriNetUnfolder]: 12876/44045 cut-off events. [2022-01-19 05:52:54,905 INFO L130 PetriNetUnfolder]: For 2587134/2594333 co-relation queries the response was YES. [2022-01-19 05:52:58,417 INFO L84 FinitePrefix]: Finished finitePrefix Result has 272908 conditions, 44045 events. 12876/44045 cut-off events. For 2587134/2594333 co-relation queries the response was YES. Maximal size of possible extension queue 1715. Compared 611833 event pairs, 2720 based on Foata normal form. 1073/43147 useless extension candidates. Maximal degree in co-relation 272614. Up to 12848 conditions per place. [2022-01-19 05:52:58,605 INFO L132 encePairwiseOnDemand]: 148/166 looper letters, 1473 selfloop transitions, 347 changer transitions 297/2244 dead transitions. [2022-01-19 05:52:58,605 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1123 places, 2244 transitions, 40477 flow [2022-01-19 05:52:58,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-01-19 05:52:58,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2022-01-19 05:52:58,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 9609 transitions. [2022-01-19 05:52:58,609 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7327283818819582 [2022-01-19 05:52:58,610 INFO L72 ComplementDD]: Start complementDD. Operand 79 states and 9609 transitions. [2022-01-19 05:52:58,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 9609 transitions. [2022-01-19 05:52:58,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:52:58,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 79 states and 9609 transitions. [2022-01-19 05:52:58,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 80 states, 79 states have (on average 121.63291139240506) internal successors, (9609), 79 states have internal predecessors, (9609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:52:58,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 80 states, 80 states have (on average 166.0) internal successors, (13280), 80 states have internal predecessors, (13280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:52:58,622 INFO L81 ComplementDD]: Finished complementDD. Result has 80 states, 80 states have (on average 166.0) internal successors, (13280), 80 states have internal predecessors, (13280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:52:58,622 INFO L186 Difference]: Start difference. First operand has 1068 places, 1825 transitions, 29016 flow. Second operand 79 states and 9609 transitions. [2022-01-19 05:52:58,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1123 places, 2244 transitions, 40477 flow [2022-01-19 05:53:14,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1094 places, 2244 transitions, 39008 flow, removed 157 selfloop flow, removed 29 redundant places. [2022-01-19 05:53:14,056 INFO L242 Difference]: Finished difference. Result has 1104 places, 1718 transitions, 26605 flow [2022-01-19 05:53:14,057 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=27819, PETRI_DIFFERENCE_MINUEND_PLACES=1016, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1825, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=332, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=79, PETRI_FLOW=26605, PETRI_PLACES=1104, PETRI_TRANSITIONS=1718} [2022-01-19 05:53:14,057 INFO L334 CegarLoopForPetriNet]: 140 programPoint places, 964 predicate places. [2022-01-19 05:53:14,058 INFO L470 AbstractCegarLoop]: Abstraction has has 1104 places, 1718 transitions, 26605 flow [2022-01-19 05:53:14,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 117.28205128205128) internal successors, (4574), 39 states have internal predecessors, (4574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:53:14,058 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:53:14,058 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:53:14,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-01-19 05:53:14,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-01-19 05:53:14,276 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 05:53:14,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:53:14,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1956081130, now seen corresponding path program 2 times [2022-01-19 05:53:14,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:53:14,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262559510] [2022-01-19 05:53:14,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:53:14,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:53:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:53:14,401 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:53:14,402 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:53:14,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262559510] [2022-01-19 05:53:14,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262559510] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 05:53:14,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940267845] [2022-01-19 05:53:14,402 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 05:53:14,402 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:53:14,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 05:53:14,403 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 05:53:14,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-01-19 05:53:14,500 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-19 05:53:14,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 05:53:14,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-19 05:53:14,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 05:53:15,094 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-19 05:53:15,094 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 05:53:15,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940267845] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:53:15,094 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 05:53:15,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [17] total 29 [2022-01-19 05:53:15,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572830526] [2022-01-19 05:53:15,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:53:15,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-19 05:53:15,094 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:53:15,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-19 05:53:15,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2022-01-19 05:53:15,096 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 166 [2022-01-19 05:53:15,096 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1104 places, 1718 transitions, 26605 flow. Second operand has 14 states, 14 states have (on average 118.07142857142857) internal successors, (1653), 14 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:53:15,096 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:53:15,096 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 166 [2022-01-19 05:53:15,096 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:53:20,637 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([575] L703-->L702-2: Formula: (= (+ |v_thr2Thread3of3ForFork0_~t~0#1_5| 1) v_~x~0_2) InVars {thr2Thread3of3ForFork0_~t~0#1=|v_thr2Thread3of3ForFork0_~t~0#1_5|} OutVars{~x~0=v_~x~0_2, thr2Thread3of3ForFork0_~t~0#1=|v_thr2Thread3of3ForFork0_~t~0#1_5|} AuxVars[] AssignedVars[~x~0][654], [Black: 9709#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 9685#(and (<= ~x~0 2) (< 2 ~n~0) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 9683#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 9661#(and (<= ~x~0 2) (< 2 ~n~0) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 9673#(and (<= ~x~0 2) (< 2 ~n~0) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|)), Black: 9695#(and (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= (+ 2 |thr2Thread2of3ForFork0_~t~0#1|) ~n~0)), Black: 9707#(and (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= 2 ~n~0)), Black: 9697#(and (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= 2 ~n~0)), Black: 9687#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|)), Black: 9671#(and (<= ~x~0 2) (< 2 ~n~0) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 9691#(and (<= ~x~0 2) (< 2 ~n~0) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 9667#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 9719#(and (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 9693#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 9657#(and (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= 2 ~n~0)), Black: 9723#(and (< 2 ~n~0) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 9703#(and (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= (+ 2 |thr2Thread2of3ForFork0_~t~0#1|) ~n~0)), 112#thr1ENTRYtrue, Black: 9659#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 9655#(and (<= ~x~0 2) (< 2 ~n~0) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 9731#(and (< 2 ~n~0) (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 9701#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 9715#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 9627#(and (<= ~x~0 2) (< 2 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 9603#(and (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 9679#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 9711#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 9623#(and (<= ~x~0 2) (< 2 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|)), Black: 9689#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 9721#(and (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), 10513#(and (< 2 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0)), 4502#true, Black: 9677#(and (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 9705#(and (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= 2 ~n~0)), Black: 9699#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= 2 ~n~0)), Black: 9713#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 9681#(and (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 9647#(and (<= ~x~0 2) (< 2 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 9663#(and (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= 2 ~n~0)), 98#L698true, 235#true, Black: 2063#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 2059#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= ~x~0 1) (<= 2 ~n~0)), Black: 2025#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 2041#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 2023#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0)), Black: 12892#(and (<= |thr2Thread2of3ForFork0_~t~0#1| 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 3) (<= 3 ~n~0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 12862#(and (<= ~x~0 2) (<= |thr2Thread2of3ForFork0_~t~0#1| 2) (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 12902#(and (<= |thr2Thread2of3ForFork0_~t~0#1| 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 3) (<= 3 ~n~0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 12870#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 3 ~n~0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 2035#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 2073#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= 2 ~n~0)), Black: 12896#(and (<= |thr2Thread2of3ForFork0_~t~0#1| 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= ~x~0 3) (<= 3 ~n~0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 12906#(and (<= |thr2Thread2of3ForFork0_~t~0#1| 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 3) (<= 3 ~n~0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 12900#(and (<= |thr2Thread2of3ForFork0_~t~0#1| 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= ~x~0 3) (<= 3 ~n~0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 2069#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0) (<= (+ ~x~0 1) ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= 2 ~n~0)), Black: 12882#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 3 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 12904#(and (<= |thr2Thread2of3ForFork0_~t~0#1| 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 3) (<= 3 ~n~0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 2061#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 2113#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 2 ~n~0)), Black: 2125#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= 2 ~n~0)), Black: 2043#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= 2 ~n~0)), Black: 2131#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 2037#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= 2 ~n~0)), Black: 2077#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= 2 ~n~0)), Black: 2079#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0) (<= 2 ~n~0)), Black: 8739#(and (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0) (<= (+ 2 |thr2Thread1of3ForFork0_~t~0#1|) ~n~0) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| |ULTIMATE.start_main_#t~post8#1|)), Black: 2119#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= 2 ~n~0)), Black: 8779#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0) (<= (+ 2 |thr2Thread1of3ForFork0_~t~0#1|) ~n~0) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0)), Black: 8577#(and (= ~x~0 0) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 2 ~n~0)), Black: 5133#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0) (<= 2 ~n~0)), Black: 8633#(and (< 2 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1)), Black: 5101#(and (= ~x~0 0) (<= (+ ~x~0 1) ~n~0)), Black: 8603#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= 1 |ULTIMATE.start_main_#t~post8#1|) (<= 2 ~n~0)), Black: 8701#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= ~x~0 1) (<= 2 ~n~0)), Black: 8671#(and (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ 2 |thr2Thread1of3ForFork0_~t~0#1|) ~n~0) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 5143#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 8627#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 8695#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= ~x~0 1) (<= 1 |ULTIMATE.start_main_#t~post8#1|) (<= 2 ~n~0)), Black: 8727#(and (<= ~x~0 2) (< 2 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_#t~post8#1|)), Black: 5151#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= 2 ~n~0)), Black: 5181#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0) (<= 2 ~n~0)), Black: 8657#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ 2 |thr2Thread1of3ForFork0_~t~0#1|) ~n~0) (<= 1 |ULTIMATE.start_main_#t~post8#1|)), Black: 8785#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= 2 ~n~0)), Black: 5111#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_#t~post8#1| 0) (<= ~x~0 ~n~0)), Black: 8647#(and (< 2 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= 1 |ULTIMATE.start_main_#t~post8#1|)), Black: 5171#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0) (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= 2 ~n~0)), Black: 8607#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ 2 |thr2Thread1of3ForFork0_~t~0#1|) ~n~0) (<= ~x~0 1) (<= 1 |ULTIMATE.start_main_#t~post8#1|)), Black: 8599#(and (= ~x~0 0) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_#t~post8#1|) (<= 2 ~n~0)), Black: 5131#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= 2 ~n~0)), Black: 8777#(and (<= |thr2Thread1of3ForFork0_~t~0#1| |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0)), thr2Thread1of3ForFork0InUse, Black: 8617#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 (+ |ULTIMATE.start_main_#t~post8#1| 1)) (<= (+ ~x~0 1) ~n~0) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ 2 |thr2Thread1of3ForFork0_~t~0#1|) ~n~0) (<= ~x~0 1) (<= |thr2Thread1of3ForFork0_~t~0#1| |ULTIMATE.start_main_#t~post8#1|)), Black: 5153#(and (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0) (<= 0 |ULTIMATE.start_main_~i~0#1|)), Black: 8645#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= 1 |ULTIMATE.start_main_#t~post8#1|)), thr2Thread2of3ForFork0InUse, Black: 8791#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= 1 |ULTIMATE.start_main_#t~post8#1|) (<= 2 ~n~0)), Black: 8715#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 5149#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= 2 ~n~0)), thr2Thread3of3ForFork0InUse, Black: 8613#(and (= ~x~0 0) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 2 ~n~0)), Black: 5177#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= 2 ~n~0)), thr1Thread1of3ForFork1InUse, Black: 8723#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_#t~post8#1|)), Black: 5175#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= 2 ~n~0)), Black: 8631#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1)), Black: 8817#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= 2 ~n~0)), Black: 5145#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= 2 ~n~0)), Black: 8729#(and (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0) (<= (+ 2 |thr2Thread1of3ForFork0_~t~0#1|) ~n~0) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0)), Black: 5129#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 8597#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ 2 |thr2Thread1of3ForFork0_~t~0#1|) ~n~0) (<= ~x~0 1)), Black: 8717#(and (<= ~x~0 2) (< 2 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 5127#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0)), Black: 8669#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 2 ~n~0)), Black: 5125#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0)), Black: 8757#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= 2 ~n~0)), Black: 8593#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 3593#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (< 1 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0)), Black: 8699#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= ~x~0 1) (<= 2 ~n~0)), Black: 3705#(and (<= ~x~0 2) (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1)), Black: 3623#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= 2 ~n~0)), Black: 8655#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_#t~post8#1|) (<= 2 ~n~0)), Black: 2932#(<= ~x~0 ~n~0), Black: 8721#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= 1 |ULTIMATE.start_main_#t~post8#1|) (<= 2 ~n~0)), Black: 3567#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 8649#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 2 ~n~0)), Black: 8653#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0)), Black: 3571#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0)), Black: 8629#(and (<= (+ ~x~0 1) ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ 2 |thr2Thread1of3ForFork0_~t~0#1|) ~n~0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1)), Black: 3549#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0)), Black: 3555#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0) (<= 2 ~n~0)), Black: 178#(and (= ~x~0 0) (not (<= 10 ~n~0)) (<= 5 ~n~0)), Black: 3533#(and (= ~x~0 0) (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= (+ ~x~0 1) ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|)), Black: 3607#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (< 1 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|)), Black: 7829#(and (<= ~x~0 2) (< 2 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 1) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|)), Black: 3575#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= 2 ~n~0)), Black: 7831#(and (<= ~x~0 2) (< 2 ~n~0) (<= (+ 2 ~x~0) ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 1) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|)), Black: 7851#(and (<= ~x~0 2) (< 2 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0)), Black: 7809#(and (<= ~x~0 2) (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| 1)), Black: 3681#(and (<= ~x~0 2) (<= 1 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1)), Black: 7827#(and (<= ~x~0 2) (< 2 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 1) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|)), Black: 3539#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (= |ULTIMATE.start_main_#t~post8#1| 0) (<= ~x~0 ~n~0)), Black: 3140#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| 0)), Black: 7821#(and (<= ~x~0 2) (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|)), Black: 3595#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0)), Black: 7825#(and (<= ~x~0 2) (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 (+ |ULTIMATE.start_main_#t~post8#1| 1)) (<= |thr2Thread1of3ForFork0_~t~0#1| 1)), Black: 3569#(and (= ~x~0 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0)), Black: 7785#(and (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) ~n~0) (<= ~x~0 ~n~0)), Black: 3653#(and (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0) (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0)), Black: 7859#(and (< 2 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 1) (<= (+ ~x~0 1) ~n~0) (<= (+ 2 |thr2Thread3of3ForFork0_~t~0#1|) ~n~0)), Black: 3713#(and (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0) (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0)), Black: 7861#(and (<= ~x~0 2) (< 2 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 1) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (= |thr2Thread3of3ForFork0_~t~0#1| 0)), Black: 3585#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0)), Black: 3553#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= 2 ~n~0)), Black: 3573#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 3603#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1)), Black: 3133#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| 0)), Black: 214#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0) (<= 1 ~n~0)), 13322#(and (<= 5 ~n~0) (<= ~x~0 1) (<= |thr2Thread3of3ForFork0_~t~0#1| 0) (< ~n~0 10)), Black: 3587#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0)), Black: 200#(and (= ~x~0 0) (= |ULTIMATE.start_main_~i~0#1| 0)), 5301#true, Black: 210#(and (= ~x~0 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 ~n~0)), Black: 3605#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 1)), Black: 3639#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0) (<= 2 ~n~0)), Black: 3683#(and (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0)), Black: 3547#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0)), Black: 212#(and (= ~x~0 0) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 ~n~0)), Black: 3721#(and (<= ~x~0 2) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1)), 7817#(and (< 2 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0)), Black: 3723#(and (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0)), Black: 3591#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 1)), 2922#true, Black: 3551#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 736#(and (= ~x~0 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 ~n~0)), Black: 746#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (< 1 ~n~0) (<= ~x~0 1)), Black: 762#(and (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (< 1 ~n~0) (<= ~x~0 1)), Black: 768#(and (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (< 1 ~n~0) (<= ~x~0 1) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 11407#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 3 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1)), Black: 11413#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 3 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_#t~post8#1|) (<= (+ 2 ~x~0) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1)), Black: 11495#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 3) (<= 3 ~n~0) (<= |thr2Thread3of3ForFork0_~t~0#1| 2)), Black: 11411#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 3 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1)), 58#L713-7true, Black: 11391#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 3 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1)), Black: 11431#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 3 ~n~0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1)), Black: 11393#(and (<= ~x~0 2) (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1)), Black: 11465#(and (<= ~x~0 2) (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= |thr2Thread3of3ForFork0_~t~0#1| 2)), Black: 11423#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 3 ~n~0) (<= (+ 2 ~x~0) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= (+ 3 ~x~0) ~n~0)), Black: 11419#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 3 ~n~0) (<= (+ 2 ~x~0) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1)), Black: 11471#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 3) (<= 3 ~n~0) (<= |thr2Thread3of3ForFork0_~t~0#1| 2)), 6816#(and (<= ~x~0 2) (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 10545#(and (<= ~x~0 2) (< 2 ~n~0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0)), Black: 10523#(and (<= ~x~0 2) (< 2 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|)), Black: 10499#(and (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0) (<= ~x~0 ~n~0)), Black: 10517#(and (<= ~x~0 2) (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|)), Black: 2807#(and (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) ~n~0) (<= ~x~0 ~n~0)), Black: 10551#(and (<= ~x~0 2) (< 2 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0)), Black: 2853#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= |thr2Thread1of3ForFork0_~t~0#1| 1) (<= ~x~0 1) (<= 2 ~n~0)), Black: 10521#(and (<= ~x~0 2) (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 (+ |ULTIMATE.start_main_#t~post8#1| 1)) (<= |thr2Thread2of3ForFork0_~t~0#1| 1)), Black: 2869#(and (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) ~n~0) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 1) (<= 2 ~n~0)), Black: 10559#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 10547#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0)), Black: 2831#(and (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 10505#(and (<= ~x~0 2) (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1)), 1406#true, Black: 10519#(and (< 2 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0)), Black: 10549#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 2827#(and (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 1) (<= 2 ~n~0)), Black: 10525#(and (<= ~x~0 2) (< 2 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1)), Black: 10557#(and (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= (+ ~x~0 1) ~n~0) (<= (+ 2 |thr2Thread3of3ForFork0_~t~0#1|) ~n~0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1)), Black: 2821#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 1) (<= 2 ~n~0)), Black: 10555#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0)), Black: 10553#(and (< 2 ~n~0) (<= (+ ~x~0 1) ~n~0) (<= (+ 2 |thr2Thread3of3ForFork0_~t~0#1|) ~n~0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1)), Black: 2825#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 2837#(and (<= (+ 2 ~x~0) ~n~0) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 2829#(and (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 6894#(and (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= (+ ~x~0 1) ~n~0) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ 2 |thr2Thread3of3ForFork0_~t~0#1|) ~n~0)), Black: 1372#(and (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 6782#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| |ULTIMATE.start_main_#t~post8#1|)), Black: 6796#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) ~n~0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1)), Black: 6800#(and (<= (+ ~x~0 1) ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|)), Black: 1378#(and (< 2 ~n~0) (<= ~x~0 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0)), Black: 6776#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) ~n~0) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= 1 |ULTIMATE.start_main_#t~post8#1|)), Black: 6890#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 1368#(and (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 (+ |ULTIMATE.start_main_#t~post8#1| 1)) (<= ~x~0 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0)), Black: 6758#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|)), Black: 1354#(and (= ~x~0 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 1 ~n~0)), Black: 1374#(and (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 (+ |ULTIMATE.start_main_#t~post8#1| 1)) (<= ~x~0 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 6808#(and (<= (+ 2 ~x~0) ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1)), Black: 6876#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 1370#(and (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 (+ |ULTIMATE.start_main_#t~post8#1| 1)) (<= ~x~0 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0)), Black: 6940#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 1366#(and (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0)), Black: 1350#(and (= ~x~0 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_#t~post8#1|) (<= 1 ~n~0)), Black: 6900#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_#t~post8#1|)), Black: 6832#(and (<= ~x~0 2) (< 2 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 6806#(and (<= (+ 2 ~x~0) ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|)), Black: 6896#(and (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| |ULTIMATE.start_main_#t~post8#1|)), Black: 6886#(and (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0)), Black: 6916#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 6864#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| |ULTIMATE.start_main_#t~post8#1|)), Black: 6932#(and (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 6824#(and (<= (+ 2 ~x~0) ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| |ULTIMATE.start_main_#t~post8#1|)), Black: 4461#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1)), Black: 6892#(and (<= (+ ~x~0 1) ~n~0) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ 2 |thr2Thread3of3ForFork0_~t~0#1|) ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| |ULTIMATE.start_main_#t~post8#1|)), Black: 6946#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0)), Black: 4451#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= ~x~0 1)), Black: 6934#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 4457#(and (<= ~x~0 2) (< 1 ~n~0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1)), Black: 6924#(and (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= (+ ~x~0 1) ~n~0) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ 2 |thr2Thread3of3ForFork0_~t~0#1|) ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 6792#(and (<= (+ ~x~0 1) ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| |ULTIMATE.start_main_#t~post8#1|)), Black: 4467#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1)), 124#L686-1true, Black: 4465#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= ~x~0 1)), Black: 4463#(and (<= ~x~0 2) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1)), Black: 6866#(and (<= (+ ~x~0 1) ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0)), Black: 6754#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|)), Black: 6802#(and (<= (+ ~x~0 1) ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1)), Black: 6021#(and (<= ~x~0 2) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 5 ~n~0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= |thr2Thread1of3ForFork0_~k~0#1| 10) (<= 5 |thr2Thread1of3ForFork0_~k~0#1|)), Black: 6784#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1) (<= |thr2Thread1of3ForFork0_~t~0#1| |ULTIMATE.start_main_#t~post8#1|)), Black: 5959#(and (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 5 ~n~0) (<= ~x~0 1) (<= |thr2Thread1of3ForFork0_~k~0#1| 10) (<= 5 |thr2Thread1of3ForFork0_~k~0#1|)), Black: 6854#(and (<= ~x~0 2) (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| |ULTIMATE.start_main_#t~post8#1|)), Black: 5969#(and (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0) (<= ~x~0 ~n~0)), Black: 6922#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 6001#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 5 ~n~0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= ~x~0 1) (<= |thr2Thread1of3ForFork0_~k~0#1| 10) (<= 5 |thr2Thread1of3ForFork0_~k~0#1|)), Black: 6960#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 5989#(and (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0)), Black: 5730#(or (<= (+ 2 ~x~0) |thr2Thread1of3ForFork0_~k~0#1|) (= 0 |thr2Thread1of3ForFork0_assume_abort_if_not_~cond#1|)), Black: 5961#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 5 ~n~0) (<= ~x~0 1) (<= |thr2Thread1of3ForFork0_~k~0#1| 10) (<= 5 |thr2Thread1of3ForFork0_~k~0#1|)), Black: 6772#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| |ULTIMATE.start_main_#t~post8#1|)), Black: 6826#(and (<= (+ 2 ~x~0) ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1) (<= |thr2Thread1of3ForFork0_~t~0#1| |ULTIMATE.start_main_#t~post8#1|)), Black: 6009#(and (<= ~x~0 2) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 5 ~n~0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= |thr2Thread1of3ForFork0_~k~0#1| 10) (<= 5 |thr2Thread1of3ForFork0_~k~0#1|)), Black: 5310#(<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0), Black: 6986#(and (< 2 ~n~0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= |thr2Thread1of3ForFork0_~t~0#1| |ULTIMATE.start_main_#t~post8#1|)), Black: 6882#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_#t~post8#1|)), Black: 6906#(and (< 2 ~n~0) (<= ~x~0 (+ |ULTIMATE.start_main_#t~post8#1| 1)) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= |thr2Thread1of3ForFork0_~t~0#1| |ULTIMATE.start_main_#t~post8#1|)), Black: 6930#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= (+ 2 ~x~0) ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 6884#(and (<= (+ ~x~0 1) ~n~0) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ 2 |thr2Thread3of3ForFork0_~t~0#1|) ~n~0)), Black: 6820#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= 1 |ULTIMATE.start_main_#t~post8#1|)), Black: 6798#(and (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|)), Black: 6908#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_#t~post8#1|)), Black: 6804#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1)), Black: 6904#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_#t~post8#1|)), Black: 6822#(and (<= ~x~0 2) (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|)), Black: 6944#(and (<= (+ ~x~0 1) ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ 2 |thr2Thread3of3ForFork0_~t~0#1|) ~n~0)), Black: 6874#(and (<= ~x~0 2) (< 2 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), 12816#(and (<= ~x~0 2) (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), 3832#true, 159#L702-2true, 8639#(and (<= ~x~0 ~n~0) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0))]) [2022-01-19 05:53:20,638 INFO L384 tUnfolder$Statistics]: this new event has 99 ancestors and is not cut-off event [2022-01-19 05:53:20,638 INFO L387 tUnfolder$Statistics]: existing Event has 99 ancestors and is not cut-off event [2022-01-19 05:53:20,638 INFO L387 tUnfolder$Statistics]: existing Event has 99 ancestors and is not cut-off event [2022-01-19 05:53:20,638 INFO L387 tUnfolder$Statistics]: existing Event has 99 ancestors and is not cut-off event [2022-01-19 05:53:31,709 INFO L129 PetriNetUnfolder]: 8965/35855 cut-off events. [2022-01-19 05:53:31,709 INFO L130 PetriNetUnfolder]: For 1763316/1766343 co-relation queries the response was YES. [2022-01-19 05:53:34,190 INFO L84 FinitePrefix]: Finished finitePrefix Result has 209793 conditions, 35855 events. 8965/35855 cut-off events. For 1763316/1766343 co-relation queries the response was YES. Maximal size of possible extension queue 1472. Compared 510224 event pairs, 1535 based on Foata normal form. 304/33792 useless extension candidates. Maximal degree in co-relation 209503. Up to 2956 conditions per place. [2022-01-19 05:53:34,344 INFO L132 encePairwiseOnDemand]: 153/166 looper letters, 433 selfloop transitions, 691 changer transitions 108/1886 dead transitions. [2022-01-19 05:53:34,344 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1079 places, 1886 transitions, 32683 flow [2022-01-19 05:53:34,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-19 05:53:34,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-01-19 05:53:34,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 3653 transitions. [2022-01-19 05:53:34,346 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7335341365461847 [2022-01-19 05:53:34,346 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 3653 transitions. [2022-01-19 05:53:34,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 3653 transitions. [2022-01-19 05:53:34,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:53:34,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 3653 transitions. [2022-01-19 05:53:34,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 121.76666666666667) internal successors, (3653), 30 states have internal predecessors, (3653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:53:34,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 166.0) internal successors, (5146), 31 states have internal predecessors, (5146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:53:34,350 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 166.0) internal successors, (5146), 31 states have internal predecessors, (5146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:53:34,351 INFO L186 Difference]: Start difference. First operand has 1104 places, 1718 transitions, 26605 flow. Second operand 30 states and 3653 transitions. [2022-01-19 05:53:34,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1079 places, 1886 transitions, 32683 flow [2022-01-19 05:53:45,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1007 places, 1886 transitions, 30411 flow, removed 285 selfloop flow, removed 72 redundant places. [2022-01-19 05:53:45,199 INFO L242 Difference]: Finished difference. Result has 1011 places, 1677 transitions, 25344 flow [2022-01-19 05:53:45,200 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=24504, PETRI_DIFFERENCE_MINUEND_PLACES=978, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1718, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=691, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1027, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=25344, PETRI_PLACES=1011, PETRI_TRANSITIONS=1677} [2022-01-19 05:53:45,200 INFO L334 CegarLoopForPetriNet]: 140 programPoint places, 871 predicate places. [2022-01-19 05:53:45,200 INFO L470 AbstractCegarLoop]: Abstraction has has 1011 places, 1677 transitions, 25344 flow [2022-01-19 05:53:45,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 118.07142857142857) internal successors, (1653), 14 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:53:45,201 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:53:45,201 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:53:45,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-01-19 05:53:45,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-01-19 05:53:45,406 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 05:53:45,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:53:45,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1871962780, now seen corresponding path program 1 times [2022-01-19 05:53:45,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:53:45,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106106701] [2022-01-19 05:53:45,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:53:45,406 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:53:45,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:53:45,540 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:53:45,540 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:53:45,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106106701] [2022-01-19 05:53:45,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106106701] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 05:53:45,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677527947] [2022-01-19 05:53:45,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:53:45,540 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:53:45,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 05:53:45,541 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 05:53:45,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-01-19 05:53:45,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:53:45,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-19 05:53:45,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 05:53:46,046 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:53:46,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 05:53:46,272 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:53:46,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677527947] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 05:53:46,272 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 05:53:46,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 39 [2022-01-19 05:53:46,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829734519] [2022-01-19 05:53:46,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 05:53:46,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-01-19 05:53:46,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:53:46,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-01-19 05:53:46,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1315, Unknown=0, NotChecked=0, Total=1482 [2022-01-19 05:53:46,275 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 166 [2022-01-19 05:53:46,277 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1011 places, 1677 transitions, 25344 flow. Second operand has 39 states, 39 states have (on average 117.28205128205128) internal successors, (4574), 39 states have internal predecessors, (4574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:53:46,277 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:53:46,277 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 166 [2022-01-19 05:53:46,277 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:54:04,975 INFO L129 PetriNetUnfolder]: 11842/40640 cut-off events. [2022-01-19 05:54:04,975 INFO L130 PetriNetUnfolder]: For 2112077/2118512 co-relation queries the response was YES. [2022-01-19 05:54:07,984 INFO L84 FinitePrefix]: Finished finitePrefix Result has 241628 conditions, 40640 events. 11842/40640 cut-off events. For 2112077/2118512 co-relation queries the response was YES. Maximal size of possible extension queue 1547. Compared 558764 event pairs, 2197 based on Foata normal form. 1219/40028 useless extension candidates. Maximal degree in co-relation 241364. Up to 6541 conditions per place. [2022-01-19 05:54:08,329 INFO L132 encePairwiseOnDemand]: 148/166 looper letters, 962 selfloop transitions, 619 changer transitions 283/1991 dead transitions. [2022-01-19 05:54:08,329 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1057 places, 1991 transitions, 33657 flow [2022-01-19 05:54:08,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-01-19 05:54:08,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2022-01-19 05:54:08,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 8825 transitions. [2022-01-19 05:54:08,333 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7282554877042416 [2022-01-19 05:54:08,333 INFO L72 ComplementDD]: Start complementDD. Operand 73 states and 8825 transitions. [2022-01-19 05:54:08,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 8825 transitions. [2022-01-19 05:54:08,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:54:08,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 73 states and 8825 transitions. [2022-01-19 05:54:08,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 74 states, 73 states have (on average 120.89041095890411) internal successors, (8825), 73 states have internal predecessors, (8825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:54:08,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 74 states, 74 states have (on average 166.0) internal successors, (12284), 74 states have internal predecessors, (12284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:54:08,345 INFO L81 ComplementDD]: Finished complementDD. Result has 74 states, 74 states have (on average 166.0) internal successors, (12284), 74 states have internal predecessors, (12284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:54:08,345 INFO L186 Difference]: Start difference. First operand has 1011 places, 1677 transitions, 25344 flow. Second operand 73 states and 8825 transitions. [2022-01-19 05:54:08,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1057 places, 1991 transitions, 33657 flow [2022-01-19 05:54:21,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1023 places, 1991 transitions, 32135 flow, removed 168 selfloop flow, removed 34 redundant places. [2022-01-19 05:54:21,248 INFO L242 Difference]: Finished difference. Result has 1035 places, 1577 transitions, 24039 flow [2022-01-19 05:54:21,250 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=24108, PETRI_DIFFERENCE_MINUEND_PLACES=951, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1677, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=619, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1058, PETRI_DIFFERENCE_SUBTRAHEND_STATES=73, PETRI_FLOW=24039, PETRI_PLACES=1035, PETRI_TRANSITIONS=1577} [2022-01-19 05:54:21,250 INFO L334 CegarLoopForPetriNet]: 140 programPoint places, 895 predicate places. [2022-01-19 05:54:21,250 INFO L470 AbstractCegarLoop]: Abstraction has has 1035 places, 1577 transitions, 24039 flow [2022-01-19 05:54:21,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 117.28205128205128) internal successors, (4574), 39 states have internal predecessors, (4574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:54:21,251 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:54:21,251 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:54:21,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-01-19 05:54:21,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-01-19 05:54:21,451 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 05:54:21,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:54:21,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1230999098, now seen corresponding path program 2 times [2022-01-19 05:54:21,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:54:21,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069114599] [2022-01-19 05:54:21,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:54:21,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:54:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:54:21,614 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:54:21,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:54:21,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069114599] [2022-01-19 05:54:21,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069114599] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 05:54:21,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524472968] [2022-01-19 05:54:21,615 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 05:54:21,615 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:54:21,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 05:54:21,628 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 05:54:21,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-01-19 05:54:21,735 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-19 05:54:21,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 05:54:21,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-19 05:54:21,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 05:54:22,276 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-19 05:54:22,276 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 05:54:22,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524472968] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:54:22,277 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 05:54:22,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [17] total 29 [2022-01-19 05:54:22,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656546959] [2022-01-19 05:54:22,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:54:22,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-19 05:54:22,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:54:22,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-19 05:54:22,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2022-01-19 05:54:22,278 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 166 [2022-01-19 05:54:22,279 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1035 places, 1577 transitions, 24039 flow. Second operand has 14 states, 14 states have (on average 118.07142857142857) internal successors, (1653), 14 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:54:22,279 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:54:22,279 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 166 [2022-01-19 05:54:22,279 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:54:26,843 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([575] L703-->L702-2: Formula: (= (+ |v_thr2Thread3of3ForFork0_~t~0#1_5| 1) v_~x~0_2) InVars {thr2Thread3of3ForFork0_~t~0#1=|v_thr2Thread3of3ForFork0_~t~0#1_5|} OutVars{~x~0=v_~x~0_2, thr2Thread3of3ForFork0_~t~0#1=|v_thr2Thread3of3ForFork0_~t~0#1_5|} AuxVars[] AssignedVars[~x~0][623], [Black: 9709#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 9685#(and (<= ~x~0 2) (< 2 ~n~0) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 9683#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 9661#(and (<= ~x~0 2) (< 2 ~n~0) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 9673#(and (<= ~x~0 2) (< 2 ~n~0) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|)), Black: 9695#(and (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= (+ 2 |thr2Thread2of3ForFork0_~t~0#1|) ~n~0)), Black: 9707#(and (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= 2 ~n~0)), Black: 9697#(and (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= 2 ~n~0)), Black: 9687#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|)), Black: 9671#(and (<= ~x~0 2) (< 2 ~n~0) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 9691#(and (<= ~x~0 2) (< 2 ~n~0) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 9667#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 9719#(and (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 9693#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 9657#(and (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= 2 ~n~0)), Black: 9723#(and (< 2 ~n~0) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 9703#(and (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= (+ 2 |thr2Thread2of3ForFork0_~t~0#1|) ~n~0)), Black: 9659#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|)), 112#thr1ENTRYtrue, Black: 9655#(and (<= ~x~0 2) (< 2 ~n~0) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 9731#(and (< 2 ~n~0) (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 9701#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 9715#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 9627#(and (<= ~x~0 2) (< 2 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 9603#(and (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 9679#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 9711#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 9623#(and (<= ~x~0 2) (< 2 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|)), Black: 9689#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 9721#(and (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), 10513#(and (< 2 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0)), Black: 9677#(and (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 9705#(and (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= 2 ~n~0)), Black: 9699#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= 2 ~n~0)), Black: 9713#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 9681#(and (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 9647#(and (<= ~x~0 2) (< 2 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 9663#(and (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= 2 ~n~0)), 98#L698true, 235#true, Black: 2063#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 2059#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= ~x~0 1) (<= 2 ~n~0)), Black: 2025#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 2041#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 2023#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0)), Black: 12862#(and (<= ~x~0 2) (<= |thr2Thread2of3ForFork0_~t~0#1| 2) (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 2035#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 2073#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= 2 ~n~0)), Black: 2069#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0) (<= (+ ~x~0 1) ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= 2 ~n~0)), Black: 2061#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 2113#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 2 ~n~0)), Black: 2043#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= 2 ~n~0)), Black: 2037#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= 2 ~n~0)), Black: 2077#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= 2 ~n~0)), Black: 2079#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0) (<= 2 ~n~0)), Black: 8739#(and (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0) (<= (+ 2 |thr2Thread1of3ForFork0_~t~0#1|) ~n~0) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| |ULTIMATE.start_main_#t~post8#1|)), Black: 2119#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= 2 ~n~0)), Black: 8779#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0) (<= (+ 2 |thr2Thread1of3ForFork0_~t~0#1|) ~n~0) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0)), Black: 8577#(and (= ~x~0 0) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 2 ~n~0)), Black: 5133#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0) (<= 2 ~n~0)), Black: 8633#(and (< 2 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1)), Black: 5101#(and (= ~x~0 0) (<= (+ ~x~0 1) ~n~0)), Black: 8603#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= 1 |ULTIMATE.start_main_#t~post8#1|) (<= 2 ~n~0)), Black: 8671#(and (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ 2 |thr2Thread1of3ForFork0_~t~0#1|) ~n~0) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 5143#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 8627#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 8695#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= ~x~0 1) (<= 1 |ULTIMATE.start_main_#t~post8#1|) (<= 2 ~n~0)), Black: 8727#(and (<= ~x~0 2) (< 2 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_#t~post8#1|)), Black: 5151#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= 2 ~n~0)), Black: 5181#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0) (<= 2 ~n~0)), Black: 8657#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ 2 |thr2Thread1of3ForFork0_~t~0#1|) ~n~0) (<= 1 |ULTIMATE.start_main_#t~post8#1|)), Black: 5111#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_#t~post8#1| 0) (<= ~x~0 ~n~0)), Black: 8647#(and (< 2 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= 1 |ULTIMATE.start_main_#t~post8#1|)), Black: 8607#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ 2 |thr2Thread1of3ForFork0_~t~0#1|) ~n~0) (<= ~x~0 1) (<= 1 |ULTIMATE.start_main_#t~post8#1|)), Black: 5171#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0) (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= 2 ~n~0)), Black: 8599#(and (= ~x~0 0) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_#t~post8#1|) (<= 2 ~n~0)), Black: 5131#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= 2 ~n~0)), Black: 8777#(and (<= |thr2Thread1of3ForFork0_~t~0#1| |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0)), thr2Thread1of3ForFork0InUse, Black: 8617#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 (+ |ULTIMATE.start_main_#t~post8#1| 1)) (<= (+ ~x~0 1) ~n~0) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ 2 |thr2Thread1of3ForFork0_~t~0#1|) ~n~0) (<= ~x~0 1) (<= |thr2Thread1of3ForFork0_~t~0#1| |ULTIMATE.start_main_#t~post8#1|)), Black: 5153#(and (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0) (<= 0 |ULTIMATE.start_main_~i~0#1|)), Black: 8645#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= 1 |ULTIMATE.start_main_#t~post8#1|)), thr2Thread2of3ForFork0InUse, Black: 8791#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= 1 |ULTIMATE.start_main_#t~post8#1|) (<= 2 ~n~0)), Black: 8715#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 5149#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= 2 ~n~0)), thr2Thread3of3ForFork0InUse, Black: 8613#(and (= ~x~0 0) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 2 ~n~0)), Black: 5177#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= 2 ~n~0)), thr1Thread1of3ForFork1InUse, Black: 8723#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_#t~post8#1|)), Black: 5175#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= 2 ~n~0)), Black: 8631#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1)), Black: 5145#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= 2 ~n~0)), Black: 8817#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= 2 ~n~0)), Black: 8729#(and (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0) (<= (+ 2 |thr2Thread1of3ForFork0_~t~0#1|) ~n~0) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0)), Black: 5129#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 8597#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ 2 |thr2Thread1of3ForFork0_~t~0#1|) ~n~0) (<= ~x~0 1)), Black: 8717#(and (<= ~x~0 2) (< 2 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 5127#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0)), Black: 8669#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 2 ~n~0)), Black: 5125#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0)), Black: 8757#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= 2 ~n~0)), Black: 8593#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 3593#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (< 1 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0)), Black: 8699#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= ~x~0 1) (<= 2 ~n~0)), Black: 3705#(and (<= ~x~0 2) (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1)), Black: 8655#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_#t~post8#1|) (<= 2 ~n~0)), Black: 3623#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= 2 ~n~0)), Black: 8721#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= 1 |ULTIMATE.start_main_#t~post8#1|) (<= 2 ~n~0)), Black: 2932#(<= ~x~0 ~n~0), Black: 3567#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 8649#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 2 ~n~0)), Black: 3571#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0)), Black: 8629#(and (<= (+ ~x~0 1) ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ 2 |thr2Thread1of3ForFork0_~t~0#1|) ~n~0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1)), Black: 3549#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0)), Black: 3555#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0) (<= 2 ~n~0)), Black: 3533#(and (= ~x~0 0) (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= (+ ~x~0 1) ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|)), Black: 178#(and (= ~x~0 0) (not (<= 10 ~n~0)) (<= 5 ~n~0)), Black: 3607#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (< 1 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|)), Black: 3575#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= 2 ~n~0)), Black: 3681#(and (<= ~x~0 2) (<= 1 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1)), Black: 3539#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (= |ULTIMATE.start_main_#t~post8#1| 0) (<= ~x~0 ~n~0)), Black: 3140#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| 0)), Black: 3595#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0)), Black: 3569#(and (= ~x~0 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0)), Black: 3653#(and (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0) (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0)), Black: 7859#(and (< 2 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 1) (<= (+ ~x~0 1) ~n~0) (<= (+ 2 |thr2Thread3of3ForFork0_~t~0#1|) ~n~0)), Black: 3713#(and (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0) (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0)), Black: 3585#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0)), Black: 3553#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= 2 ~n~0)), Black: 3573#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 3603#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1)), Black: 3133#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| 0)), Black: 214#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0) (<= 1 ~n~0)), Black: 3587#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0)), Black: 200#(and (= ~x~0 0) (= |ULTIMATE.start_main_~i~0#1| 0)), 5301#true, Black: 210#(and (= ~x~0 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 ~n~0)), Black: 3605#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 1)), Black: 3639#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0) (<= 2 ~n~0)), Black: 3683#(and (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0)), Black: 212#(and (= ~x~0 0) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 ~n~0)), Black: 3547#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0)), Black: 3721#(and (<= ~x~0 2) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1)), Black: 3723#(and (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 ~n~0)), 2922#true, Black: 3591#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= ~x~0 1)), Black: 3551#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 736#(and (= ~x~0 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 ~n~0)), Black: 746#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (< 1 ~n~0) (<= ~x~0 1)), Black: 762#(and (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (< 1 ~n~0) (<= ~x~0 1)), Black: 768#(and (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (< 1 ~n~0) (<= ~x~0 1) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), 58#L713-7true, Black: 11431#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 3 ~n~0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1)), Black: 11393#(and (<= ~x~0 2) (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1)), Black: 11465#(and (<= ~x~0 2) (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= |thr2Thread3of3ForFork0_~t~0#1| 2)), 6816#(and (<= ~x~0 2) (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 10545#(and (<= ~x~0 2) (< 2 ~n~0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0)), Black: 10523#(and (<= ~x~0 2) (< 2 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|)), Black: 10517#(and (<= ~x~0 2) (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|)), Black: 2807#(and (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) ~n~0) (<= ~x~0 ~n~0)), Black: 10551#(and (<= ~x~0 2) (< 2 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0)), Black: 10521#(and (<= ~x~0 2) (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 (+ |ULTIMATE.start_main_#t~post8#1| 1)) (<= |thr2Thread2of3ForFork0_~t~0#1| 1)), Black: 2869#(and (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) ~n~0) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 1) (<= 2 ~n~0)), Black: 10559#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 10547#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0)), Black: 2831#(and (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= 2 ~n~0)), 1406#true, Black: 10505#(and (<= ~x~0 2) (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1)), Black: 10519#(and (< 2 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0)), Black: 10549#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 2827#(and (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 1) (<= 2 ~n~0)), Black: 10525#(and (<= ~x~0 2) (< 2 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1)), Black: 10557#(and (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= (+ ~x~0 1) ~n~0) (<= (+ 2 |thr2Thread3of3ForFork0_~t~0#1|) ~n~0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1)), Black: 2821#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 1) (<= 2 ~n~0)), Black: 10555#(and (<= ~x~0 2) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0)), Black: 10553#(and (< 2 ~n~0) (<= (+ ~x~0 1) ~n~0) (<= (+ 2 |thr2Thread3of3ForFork0_~t~0#1|) ~n~0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1)), Black: 2825#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 2837#(and (<= (+ 2 ~x~0) ~n~0) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1) (<= 2 ~n~0)), Black: 2829#(and (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1) (<= 2 ~n~0)), 14671#(and (<= 5 ~n~0) (<= ~x~0 1) (<= |thr2Thread3of3ForFork0_~t~0#1| 0) (< ~n~0 10)), Black: 6894#(and (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= (+ ~x~0 1) ~n~0) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ 2 |thr2Thread3of3ForFork0_~t~0#1|) ~n~0)), Black: 6782#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| |ULTIMATE.start_main_#t~post8#1|)), Black: 1372#(and (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 6796#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= (+ ~x~0 1) ~n~0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1)), Black: 6800#(and (<= (+ ~x~0 1) ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|)), Black: 1378#(and (< 2 ~n~0) (<= ~x~0 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0)), Black: 6890#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 1368#(and (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 (+ |ULTIMATE.start_main_#t~post8#1| 1)) (<= ~x~0 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0)), Black: 1354#(and (= ~x~0 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 1 ~n~0)), Black: 6758#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|)), Black: 1374#(and (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 (+ |ULTIMATE.start_main_#t~post8#1| 1)) (<= ~x~0 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 6808#(and (<= (+ 2 ~x~0) ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1)), Black: 6876#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 1370#(and (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 (+ |ULTIMATE.start_main_#t~post8#1| 1)) (<= ~x~0 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0)), Black: 6940#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 1366#(and (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (= |thr2Thread3of3ForFork0_~t~0#1| 0)), Black: 1350#(and (= ~x~0 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_#t~post8#1|) (<= 1 ~n~0)), Black: 6900#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_#t~post8#1|)), Black: 6832#(and (<= ~x~0 2) (< 2 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 6806#(and (<= (+ 2 ~x~0) ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|)), Black: 6896#(and (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| |ULTIMATE.start_main_#t~post8#1|)), Black: 6886#(and (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0)), Black: 6916#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 6864#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| |ULTIMATE.start_main_#t~post8#1|)), Black: 6824#(and (<= (+ 2 ~x~0) ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| |ULTIMATE.start_main_#t~post8#1|)), Black: 4461#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1)), Black: 6892#(and (<= (+ ~x~0 1) ~n~0) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ 2 |thr2Thread3of3ForFork0_~t~0#1|) ~n~0) (<= |thr2Thread1of3ForFork0_~t~0#1| |ULTIMATE.start_main_#t~post8#1|)), Black: 6946#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0)), Black: 6934#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 4451#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= ~x~0 1)), Black: 4457#(and (<= ~x~0 2) (< 1 ~n~0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1)), Black: 6924#(and (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= (+ ~x~0 1) ~n~0) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ 2 |thr2Thread3of3ForFork0_~t~0#1|) ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 6792#(and (<= (+ ~x~0 1) ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| |ULTIMATE.start_main_#t~post8#1|)), Black: 4467#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1)), Black: 4465#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= ~x~0 1)), 124#L686-1true, Black: 4463#(and (<= ~x~0 2) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (< 1 ~n~0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1)), Black: 6866#(and (<= (+ ~x~0 1) ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0)), Black: 6754#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|)), Black: 6802#(and (<= (+ ~x~0 1) ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1)), Black: 6784#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ ~x~0 1) ~n~0) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1) (<= |thr2Thread1of3ForFork0_~t~0#1| |ULTIMATE.start_main_#t~post8#1|)), Black: 6021#(and (<= ~x~0 2) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 5 ~n~0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= |thr2Thread1of3ForFork0_~k~0#1| 10) (<= 5 |thr2Thread1of3ForFork0_~k~0#1|)), Black: 5959#(and (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 5 ~n~0) (<= ~x~0 1) (<= |thr2Thread1of3ForFork0_~k~0#1| 10) (<= 5 |thr2Thread1of3ForFork0_~k~0#1|)), Black: 5969#(and (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0) (<= ~x~0 ~n~0)), Black: 6922#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 6001#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 5 ~n~0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= ~x~0 1) (<= |thr2Thread1of3ForFork0_~k~0#1| 10) (<= 5 |thr2Thread1of3ForFork0_~k~0#1|)), Black: 6960#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 5989#(and (<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 ~n~0)), Black: 5730#(or (<= (+ 2 ~x~0) |thr2Thread1of3ForFork0_~k~0#1|) (= 0 |thr2Thread1of3ForFork0_assume_abort_if_not_~cond#1|)), Black: 5961#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 5 ~n~0) (<= ~x~0 1) (<= |thr2Thread1of3ForFork0_~k~0#1| 10) (<= 5 |thr2Thread1of3ForFork0_~k~0#1|)), Black: 6772#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= |thr2Thread1of3ForFork0_~t~0#1| |ULTIMATE.start_main_#t~post8#1|)), Black: 6826#(and (<= (+ 2 ~x~0) ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= ~x~0 1) (<= |thr2Thread1of3ForFork0_~t~0#1| |ULTIMATE.start_main_#t~post8#1|)), Black: 6009#(and (<= ~x~0 2) (<= |thr2Thread1of3ForFork0_~t~0#1| 0) (<= 5 ~n~0) (<= |thr2Thread2of3ForFork0_~t~0#1| 1) (<= |thr2Thread1of3ForFork0_~k~0#1| 10) (<= 5 |thr2Thread1of3ForFork0_~k~0#1|)), Black: 5310#(<= (+ |thr2Thread2of3ForFork0_~t~0#1| 1) ~n~0), Black: 6882#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_#t~post8#1|)), Black: 6930#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= (+ 2 ~x~0) ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 2 |ULTIMATE.start_main_~i~0#1|)), Black: 6884#(and (<= (+ ~x~0 1) ~n~0) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ 2 |thr2Thread3of3ForFork0_~t~0#1|) ~n~0)), Black: 6820#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1) (<= 1 |ULTIMATE.start_main_#t~post8#1|)), Black: 14223#(and (<= ~x~0 2) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= 3 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 6798#(and (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|)), Black: 14213#(and (<= ~x~0 2) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= 3 ~n~0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 14219#(and (<= ~x~0 2) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= 3 ~n~0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 6908#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_#t~post8#1|)), Black: 14221#(and (<= ~x~0 2) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= 3 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 14249#(and (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 3) (<= 3 ~n~0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= |thr2Thread1of3ForFork0_~t~0#1| 2)), Black: 14235#(and (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 3) (<= 3 ~n~0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= |thr2Thread1of3ForFork0_~t~0#1| 2)), Black: 6804#(and (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~x~0 1)), Black: 14217#(and (<= ~x~0 2) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= 3 ~n~0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), Black: 14225#(and (<= ~x~0 2) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= 3 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 6904#(and (<= ~x~0 2) (= |thr2Thread1of3ForFork0_~t~0#1| 0) (< 2 ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|) (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_#t~post8#1|)), Black: 14239#(and (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 3) (<= 3 ~n~0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= |thr2Thread1of3ForFork0_~t~0#1| 2)), Black: 6822#(and (<= ~x~0 2) (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= ~x~0 |ULTIMATE.start_main_#t~post8#1|)), Black: 14247#(and (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 3) (<= 3 ~n~0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= |thr2Thread1of3ForFork0_~t~0#1| 2) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 6944#(and (<= (+ ~x~0 1) ~n~0) (<= (+ ~x~0 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ |thr2Thread1of3ForFork0_~t~0#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= (+ 2 |thr2Thread3of3ForFork0_~t~0#1|) ~n~0)), Black: 14253#(and (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 3) (<= 3 ~n~0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= |thr2Thread1of3ForFork0_~t~0#1| 2) (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_~cond#1|)), Black: 14251#(and (<= 1 |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond#1|) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (= |thr2Thread2of3ForFork0_~t~0#1| 0) (<= ~x~0 3) (<= 3 ~n~0) (<= |thr2Thread3of3ForFork0_~t~0#1| 1) (<= |thr2Thread1of3ForFork0_~t~0#1| 2)), 12816#(and (<= ~x~0 2) (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), 14175#(and (<= ~x~0 2) (< 2 ~n~0) (<= ~x~0 |ULTIMATE.start_main_~i~0#1|) (<= |thr2Thread3of3ForFork0_~t~0#1| 1)), 3832#true, 159#L702-2true, 8639#(and (<= ~x~0 ~n~0) (<= (+ |thr2Thread3of3ForFork0_~t~0#1| 1) ~n~0))]) [2022-01-19 05:54:26,844 INFO L384 tUnfolder$Statistics]: this new event has 99 ancestors and is not cut-off event [2022-01-19 05:54:26,844 INFO L387 tUnfolder$Statistics]: existing Event has 99 ancestors and is not cut-off event [2022-01-19 05:54:26,844 INFO L387 tUnfolder$Statistics]: existing Event has 99 ancestors and is not cut-off event [2022-01-19 05:54:26,844 INFO L387 tUnfolder$Statistics]: existing Event has 99 ancestors and is not cut-off event [2022-01-19 05:54:35,240 INFO L129 PetriNetUnfolder]: 7694/32141 cut-off events. [2022-01-19 05:54:35,240 INFO L130 PetriNetUnfolder]: For 1264605/1267446 co-relation queries the response was YES. [2022-01-19 05:54:37,266 INFO L84 FinitePrefix]: Finished finitePrefix Result has 175047 conditions, 32141 events. 7694/32141 cut-off events. For 1264605/1267446 co-relation queries the response was YES. Maximal size of possible extension queue 1346. Compared 454564 event pairs, 1877 based on Foata normal form. 319/30114 useless extension candidates. Maximal degree in co-relation 174785. Up to 5464 conditions per place. [2022-01-19 05:54:37,382 INFO L132 encePairwiseOnDemand]: 153/166 looper letters, 422 selfloop transitions, 494 changer transitions 137/1674 dead transitions. [2022-01-19 05:54:37,383 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 986 places, 1674 transitions, 28153 flow [2022-01-19 05:54:37,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-19 05:54:37,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-01-19 05:54:37,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 3043 transitions. [2022-01-19 05:54:37,384 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7332530120481928 [2022-01-19 05:54:37,385 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 3043 transitions. [2022-01-19 05:54:37,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 3043 transitions. [2022-01-19 05:54:37,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:54:37,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 3043 transitions. [2022-01-19 05:54:37,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 121.72) internal successors, (3043), 25 states have internal predecessors, (3043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:54:37,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 166.0) internal successors, (4316), 26 states have internal predecessors, (4316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:54:37,389 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 166.0) internal successors, (4316), 26 states have internal predecessors, (4316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:54:37,389 INFO L186 Difference]: Start difference. First operand has 1035 places, 1577 transitions, 24039 flow. Second operand 25 states and 3043 transitions. [2022-01-19 05:54:37,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 986 places, 1674 transitions, 28153 flow [2022-01-19 05:54:44,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 926 places, 1674 transitions, 27086 flow, removed 46 selfloop flow, removed 60 redundant places. [2022-01-19 05:54:44,577 INFO L242 Difference]: Finished difference. Result has 929 places, 1496 transitions, 22913 flow [2022-01-19 05:54:44,578 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=22996, PETRI_DIFFERENCE_MINUEND_PLACES=902, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=494, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1083, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=22913, PETRI_PLACES=929, PETRI_TRANSITIONS=1496} [2022-01-19 05:54:44,578 INFO L334 CegarLoopForPetriNet]: 140 programPoint places, 789 predicate places. [2022-01-19 05:54:44,578 INFO L470 AbstractCegarLoop]: Abstraction has has 929 places, 1496 transitions, 22913 flow [2022-01-19 05:54:44,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 118.07142857142857) internal successors, (1653), 14 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:54:44,579 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:54:44,579 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:54:44,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-01-19 05:54:44,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:54:44,779 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 05:54:44,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:54:44,780 INFO L85 PathProgramCache]: Analyzing trace with hash 593440558, now seen corresponding path program 3 times [2022-01-19 05:54:44,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:54:44,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055478367] [2022-01-19 05:54:44,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:54:44,780 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:54:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:54:44,893 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:54:44,893 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:54:44,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055478367] [2022-01-19 05:54:44,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055478367] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 05:54:44,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780001821] [2022-01-19 05:54:44,894 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 05:54:44,894 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:54:44,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 05:54:44,895 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 05:54:44,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-01-19 05:54:44,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-19 05:54:45,000 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 05:54:45,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-19 05:54:45,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 05:54:45,569 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-19 05:54:45,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 05:54:45,793 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-19 05:54:45,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780001821] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 05:54:45,794 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 05:54:45,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 34 [2022-01-19 05:54:45,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799874718] [2022-01-19 05:54:45,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 05:54:45,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-01-19 05:54:45,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:54:45,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-01-19 05:54:45,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=987, Unknown=0, NotChecked=0, Total=1122 [2022-01-19 05:54:45,796 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 166 [2022-01-19 05:54:45,797 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 929 places, 1496 transitions, 22913 flow. Second operand has 34 states, 34 states have (on average 113.76470588235294) internal successors, (3868), 34 states have internal predecessors, (3868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:54:45,797 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:54:45,797 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 166 [2022-01-19 05:54:45,797 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:54:59,697 INFO L129 PetriNetUnfolder]: 9659/32390 cut-off events. [2022-01-19 05:54:59,697 INFO L130 PetriNetUnfolder]: For 1585240/1590757 co-relation queries the response was YES. [2022-01-19 05:55:01,695 INFO L84 FinitePrefix]: Finished finitePrefix Result has 191783 conditions, 32390 events. 9659/32390 cut-off events. For 1585240/1590757 co-relation queries the response was YES. Maximal size of possible extension queue 1370. Compared 427703 event pairs, 736 based on Foata normal form. 981/31908 useless extension candidates. Maximal degree in co-relation 191537. Up to 2172 conditions per place. [2022-01-19 05:55:01,742 INFO L132 encePairwiseOnDemand]: 146/166 looper letters, 162 selfloop transitions, 137 changer transitions 1921/2340 dead transitions. [2022-01-19 05:55:01,743 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 931 places, 2340 transitions, 43242 flow [2022-01-19 05:55:01,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-01-19 05:55:01,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2022-01-19 05:55:01,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 7384 transitions. [2022-01-19 05:55:01,746 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7060623446165615 [2022-01-19 05:55:01,746 INFO L72 ComplementDD]: Start complementDD. Operand 63 states and 7384 transitions. [2022-01-19 05:55:01,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 7384 transitions. [2022-01-19 05:55:01,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:55:01,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 63 states and 7384 transitions. [2022-01-19 05:55:01,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 64 states, 63 states have (on average 117.2063492063492) internal successors, (7384), 63 states have internal predecessors, (7384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:55:01,755 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 64 states, 64 states have (on average 166.0) internal successors, (10624), 64 states have internal predecessors, (10624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:55:01,756 INFO L81 ComplementDD]: Finished complementDD. Result has 64 states, 64 states have (on average 166.0) internal successors, (10624), 64 states have internal predecessors, (10624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:55:01,756 INFO L186 Difference]: Start difference. First operand has 929 places, 1496 transitions, 22913 flow. Second operand 63 states and 7384 transitions. [2022-01-19 05:55:01,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 931 places, 2340 transitions, 43242 flow [2022-01-19 05:55:09,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 899 places, 2340 transitions, 41067 flow, removed 776 selfloop flow, removed 32 redundant places. [2022-01-19 05:55:09,561 INFO L242 Difference]: Finished difference. Result has 919 places, 353 transitions, 3351 flow [2022-01-19 05:55:09,561 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=22077, PETRI_DIFFERENCE_MINUEND_PLACES=837, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1496, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=3351, PETRI_PLACES=919, PETRI_TRANSITIONS=353} [2022-01-19 05:55:09,562 INFO L334 CegarLoopForPetriNet]: 140 programPoint places, 779 predicate places. [2022-01-19 05:55:09,562 INFO L470 AbstractCegarLoop]: Abstraction has has 919 places, 353 transitions, 3351 flow [2022-01-19 05:55:09,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 113.76470588235294) internal successors, (3868), 34 states have internal predecessors, (3868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:55:09,562 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:55:09,562 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:55:09,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-01-19 05:55:09,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-01-19 05:55:09,763 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 05:55:09,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:55:09,763 INFO L85 PathProgramCache]: Analyzing trace with hash -63855636, now seen corresponding path program 3 times [2022-01-19 05:55:09,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:55:09,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589600770] [2022-01-19 05:55:09,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:55:09,764 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:55:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:55:09,883 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:55:09,884 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:55:09,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589600770] [2022-01-19 05:55:09,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589600770] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 05:55:09,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96434095] [2022-01-19 05:55:09,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 05:55:09,884 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:55:09,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 05:55:09,885 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 05:55:09,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-01-19 05:55:09,993 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-19 05:55:09,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 05:55:09,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-19 05:55:09,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 05:55:10,558 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-19 05:55:10,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 05:55:10,773 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-19 05:55:10,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96434095] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 05:55:10,773 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 05:55:10,773 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 34 [2022-01-19 05:55:10,773 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983451030] [2022-01-19 05:55:10,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 05:55:10,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-01-19 05:55:10,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:55:10,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-01-19 05:55:10,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=987, Unknown=0, NotChecked=0, Total=1122 [2022-01-19 05:55:10,776 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 166 [2022-01-19 05:55:10,777 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 919 places, 353 transitions, 3351 flow. Second operand has 34 states, 34 states have (on average 113.76470588235294) internal successors, (3868), 34 states have internal predecessors, (3868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:55:10,777 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:55:10,777 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 166 [2022-01-19 05:55:10,777 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:55:13,705 INFO L129 PetriNetUnfolder]: 2272/7535 cut-off events. [2022-01-19 05:55:13,705 INFO L130 PetriNetUnfolder]: For 436188/436938 co-relation queries the response was YES. [2022-01-19 05:55:14,024 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44019 conditions, 7535 events. 2272/7535 cut-off events. For 436188/436938 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 73448 event pairs, 179 based on Foata normal form. 142/7327 useless extension candidates. Maximal degree in co-relation 43775. Up to 466 conditions per place. [2022-01-19 05:55:14,031 INFO L132 encePairwiseOnDemand]: 146/166 looper letters, 0 selfloop transitions, 0 changer transitions 538/538 dead transitions. [2022-01-19 05:55:14,032 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 590 places, 538 transitions, 8668 flow [2022-01-19 05:55:14,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-01-19 05:55:14,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2022-01-19 05:55:14,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 5139 transitions. [2022-01-19 05:55:14,034 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7035870755750274 [2022-01-19 05:55:14,034 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 5139 transitions. [2022-01-19 05:55:14,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 5139 transitions. [2022-01-19 05:55:14,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:55:14,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 5139 transitions. [2022-01-19 05:55:14,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 45 states, 44 states have (on average 116.79545454545455) internal successors, (5139), 44 states have internal predecessors, (5139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:55:14,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 45 states, 45 states have (on average 166.0) internal successors, (7470), 45 states have internal predecessors, (7470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:55:14,042 INFO L81 ComplementDD]: Finished complementDD. Result has 45 states, 45 states have (on average 166.0) internal successors, (7470), 45 states have internal predecessors, (7470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:55:14,042 INFO L186 Difference]: Start difference. First operand has 919 places, 353 transitions, 3351 flow. Second operand 44 states and 5139 transitions. [2022-01-19 05:55:14,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 590 places, 538 transitions, 8668 flow [2022-01-19 05:55:14,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 538 transitions, 5213 flow, removed 1394 selfloop flow, removed 151 redundant places. [2022-01-19 05:55:14,696 INFO L242 Difference]: Finished difference. Result has 439 places, 0 transitions, 0 flow [2022-01-19 05:55:14,696 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=2442, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=0, PETRI_PLACES=439, PETRI_TRANSITIONS=0} [2022-01-19 05:55:14,696 INFO L334 CegarLoopForPetriNet]: 140 programPoint places, 299 predicate places. [2022-01-19 05:55:14,696 INFO L470 AbstractCegarLoop]: Abstraction has has 439 places, 0 transitions, 0 flow [2022-01-19 05:55:14,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 113.76470588235294) internal successors, (3868), 34 states have internal predecessors, (3868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:55:14,697 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-01-19 05:55:14,697 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-01-19 05:55:14,697 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-01-19 05:55:14,697 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-01-19 05:55:14,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-01-19 05:55:14,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-01-19 05:55:14,898 INFO L732 BasicCegarLoop]: Path program histogram: [5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 05:55:14,898 INFO L309 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE (1/2) [2022-01-19 05:55:14,899 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2022-01-19 05:55:14,899 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 05:55:14,899 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-01-19 05:55:14,899 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 169 places, 166 transitions, 374 flow [2022-01-19 05:55:14,908 INFO L129 PetriNetUnfolder]: 12/191 cut-off events. [2022-01-19 05:55:14,908 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-01-19 05:55:14,909 INFO L84 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 191 events. 12/191 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 345 event pairs, 0 based on Foata normal form. 0/174 useless extension candidates. Maximal degree in co-relation 205. Up to 8 conditions per place. [2022-01-19 05:55:14,909 INFO L82 GeneralOperation]: Start removeDead. Operand has 169 places, 166 transitions, 374 flow [2022-01-19 05:55:14,909 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 139 transitions, 302 flow [2022-01-19 05:55:14,916 INFO L129 PetriNetUnfolder]: 11/178 cut-off events. [2022-01-19 05:55:14,917 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-01-19 05:55:14,917 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:55:14,917 INFO L254 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 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] [2022-01-19 05:55:14,917 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-19 05:55:14,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:55:14,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1632407279, now seen corresponding path program 1 times [2022-01-19 05:55:14,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:55:14,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274759658] [2022-01-19 05:55:14,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:55:14,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:55:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 05:55:14,926 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 05:55:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 05:55:14,947 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 05:55:14,947 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 05:55:14,947 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 2 remaining) [2022-01-19 05:55:14,948 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 2 remaining) [2022-01-19 05:55:14,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-19 05:55:14,948 INFO L732 BasicCegarLoop]: Path program histogram: [1] [2022-01-19 05:55:14,948 INFO L309 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (2/2) [2022-01-19 05:55:14,948 WARN L235 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2022-01-19 05:55:14,948 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2022-01-19 05:55:14,960 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,960 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,960 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,960 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,961 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,961 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,961 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,961 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,961 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,961 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,961 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,961 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,961 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,961 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,961 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,961 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,961 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,961 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,961 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,961 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,962 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,962 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,962 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,962 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,962 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,962 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,962 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,962 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,962 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,962 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,962 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,962 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,962 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,962 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,962 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,962 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,962 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,962 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,962 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,962 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,963 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,963 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,963 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,963 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,963 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,963 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,963 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,963 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,963 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,963 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,963 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,963 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,963 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,963 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,963 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,963 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,963 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,963 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,964 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,964 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,964 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,964 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,964 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,964 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,964 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,964 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,964 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,964 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,964 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,964 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,964 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,964 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,964 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,964 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,964 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,964 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,964 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,964 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,965 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,965 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,965 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,965 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,965 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,965 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,965 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,965 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,965 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,965 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,965 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,965 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,965 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,965 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,965 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,965 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,965 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,965 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,965 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,966 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,966 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,966 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,966 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,966 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,966 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,966 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,966 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,966 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,966 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,966 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,966 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,966 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,966 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,966 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,966 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,966 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,966 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,966 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,966 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,967 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,967 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,967 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,967 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,967 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,967 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,967 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,967 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,967 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,967 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,967 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,967 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,967 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,967 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,967 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,967 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,967 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,967 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,968 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,968 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,968 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,968 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,968 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,968 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,968 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,968 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,968 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,968 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,968 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,968 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,968 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,968 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,968 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,968 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,968 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,968 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,969 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,969 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,969 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,969 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,969 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,969 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,969 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,969 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,969 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,969 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,969 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,969 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,969 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,969 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,969 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,969 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,969 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,970 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,970 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,970 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,970 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,970 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,970 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,970 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,970 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,970 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,970 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,970 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,970 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,970 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,970 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,970 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,970 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,970 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,970 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,970 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,970 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,970 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,971 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,971 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,971 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,971 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,971 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,971 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,971 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,971 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,971 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,971 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,971 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,971 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,971 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,971 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,971 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,971 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,971 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,971 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,971 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,971 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,972 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,972 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,972 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,972 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,972 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,972 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,972 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,972 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,972 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,972 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,972 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,972 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,972 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,972 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,972 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,972 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,972 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,972 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,972 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,972 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,972 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,973 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,973 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,973 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,973 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,973 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,973 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,973 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,973 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,973 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,973 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,973 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,973 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,973 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,973 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,973 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,973 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,974 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,974 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,974 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,974 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,974 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,974 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,974 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,974 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,974 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,974 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,974 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,974 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,975 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,975 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,975 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,975 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,975 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,975 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,975 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,975 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,975 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,975 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,975 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,975 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,975 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,975 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,975 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,975 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,976 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,976 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,976 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,976 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,976 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,976 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,976 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,976 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,976 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,976 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,976 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,976 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,977 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,977 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,977 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,977 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,977 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,977 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,977 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,977 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,977 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,977 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,977 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,977 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,978 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,978 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,978 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,978 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,978 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,978 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,978 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,978 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,978 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,978 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,978 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,978 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:55:14,978 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-19 05:55:14,979 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 05:55:14,979 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 05:55:14,979 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-01-19 05:55:14,980 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 204 places, 200 transitions, 464 flow [2022-01-19 05:55:14,992 INFO L129 PetriNetUnfolder]: 15/231 cut-off events. [2022-01-19 05:55:14,992 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-01-19 05:55:14,993 INFO L84 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 231 events. 15/231 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 459 event pairs, 0 based on Foata normal form. 0/210 useless extension candidates. Maximal degree in co-relation 251. Up to 10 conditions per place. [2022-01-19 05:55:14,993 INFO L82 GeneralOperation]: Start removeDead. Operand has 204 places, 200 transitions, 464 flow [2022-01-19 05:55:14,994 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 160 transitions, 355 flow [2022-01-19 05:55:14,996 INFO L129 PetriNetUnfolder]: 3/63 cut-off events. [2022-01-19 05:55:14,996 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 05:55:14,996 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:55:14,997 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] [2022-01-19 05:55:14,997 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 05:55:14,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:55:14,997 INFO L85 PathProgramCache]: Analyzing trace with hash -326012866, now seen corresponding path program 1 times [2022-01-19 05:55:14,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:55:14,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745462380] [2022-01-19 05:55:14,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:55:14,997 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:55:15,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:55:15,069 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 05:55:15,070 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:55:15,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745462380] [2022-01-19 05:55:15,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745462380] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:55:15,070 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:55:15,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 05:55:15,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434379135] [2022-01-19 05:55:15,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:55:15,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 05:55:15,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:55:15,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 05:55:15,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-01-19 05:55:15,071 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 200 [2022-01-19 05:55:15,072 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 160 transitions, 355 flow. Second operand has 9 states, 9 states have (on average 144.44444444444446) internal successors, (1300), 9 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:55:15,072 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:55:15,072 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 200 [2022-01-19 05:55:15,072 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:55:20,329 INFO L129 PetriNetUnfolder]: 45643/72699 cut-off events. [2022-01-19 05:55:20,329 INFO L130 PetriNetUnfolder]: For 8184/8184 co-relation queries the response was YES. [2022-01-19 05:55:20,584 INFO L84 FinitePrefix]: Finished finitePrefix Result has 134417 conditions, 72699 events. 45643/72699 cut-off events. For 8184/8184 co-relation queries the response was YES. Maximal size of possible extension queue 3560. Compared 661418 event pairs, 8708 based on Foata normal form. 8716/63830 useless extension candidates. Maximal degree in co-relation 134358. Up to 16265 conditions per place. [2022-01-19 05:55:20,906 INFO L132 encePairwiseOnDemand]: 181/200 looper letters, 48 selfloop transitions, 8 changer transitions 118/287 dead transitions. [2022-01-19 05:55:20,906 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 287 transitions, 1085 flow [2022-01-19 05:55:20,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 05:55:20,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 05:55:20,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1784 transitions. [2022-01-19 05:55:20,907 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8109090909090909 [2022-01-19 05:55:20,907 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1784 transitions. [2022-01-19 05:55:20,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1784 transitions. [2022-01-19 05:55:20,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:55:20,908 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1784 transitions. [2022-01-19 05:55:20,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 162.1818181818182) internal successors, (1784), 11 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:55:20,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 200.0) internal successors, (2400), 12 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:55:20,910 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 200.0) internal successors, (2400), 12 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:55:20,910 INFO L186 Difference]: Start difference. First operand has 161 places, 160 transitions, 355 flow. Second operand 11 states and 1784 transitions. [2022-01-19 05:55:20,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 287 transitions, 1085 flow [2022-01-19 05:55:20,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 287 transitions, 1036 flow, removed 24 selfloop flow, removed 1 redundant places. [2022-01-19 05:55:20,913 INFO L242 Difference]: Finished difference. Result has 174 places, 152 transitions, 381 flow [2022-01-19 05:55:20,913 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=381, PETRI_PLACES=174, PETRI_TRANSITIONS=152} [2022-01-19 05:55:20,914 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 13 predicate places. [2022-01-19 05:55:20,914 INFO L470 AbstractCegarLoop]: Abstraction has has 174 places, 152 transitions, 381 flow [2022-01-19 05:55:20,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 144.44444444444446) internal successors, (1300), 9 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:55:20,914 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:55:20,914 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] [2022-01-19 05:55:20,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-19 05:55:20,914 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 05:55:20,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:55:20,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1636824872, now seen corresponding path program 1 times [2022-01-19 05:55:20,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:55:20,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372585034] [2022-01-19 05:55:20,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:55:20,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:55:20,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:55:20,957 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 05:55:20,957 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:55:20,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372585034] [2022-01-19 05:55:20,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372585034] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:55:20,957 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:55:20,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 05:55:20,957 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267074881] [2022-01-19 05:55:20,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:55:20,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 05:55:20,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:55:20,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 05:55:20,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-01-19 05:55:20,959 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 200 [2022-01-19 05:55:20,959 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 152 transitions, 381 flow. Second operand has 9 states, 9 states have (on average 144.0) internal successors, (1296), 9 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:55:20,959 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:55:20,959 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 200 [2022-01-19 05:55:20,959 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:55:27,072 INFO L129 PetriNetUnfolder]: 50291/76759 cut-off events. [2022-01-19 05:55:27,073 INFO L130 PetriNetUnfolder]: For 42308/42308 co-relation queries the response was YES. [2022-01-19 05:55:27,429 INFO L84 FinitePrefix]: Finished finitePrefix Result has 184901 conditions, 76759 events. 50291/76759 cut-off events. For 42308/42308 co-relation queries the response was YES. Maximal size of possible extension queue 3643. Compared 657758 event pairs, 4285 based on Foata normal form. 650/63271 useless extension candidates. Maximal degree in co-relation 184837. Up to 26896 conditions per place. [2022-01-19 05:55:27,763 INFO L132 encePairwiseOnDemand]: 186/200 looper letters, 115 selfloop transitions, 21 changer transitions 80/327 dead transitions. [2022-01-19 05:55:27,763 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 327 transitions, 1417 flow [2022-01-19 05:55:27,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-19 05:55:27,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-19 05:55:27,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2348 transitions. [2022-01-19 05:55:27,764 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7826666666666666 [2022-01-19 05:55:27,764 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2348 transitions. [2022-01-19 05:55:27,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2348 transitions. [2022-01-19 05:55:27,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:55:27,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2348 transitions. [2022-01-19 05:55:27,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 156.53333333333333) internal successors, (2348), 15 states have internal predecessors, (2348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:55:27,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 200.0) internal successors, (3200), 16 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 05:55:27,767 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 200.0) internal successors, (3200), 16 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 05:55:27,767 INFO L186 Difference]: Start difference. First operand has 174 places, 152 transitions, 381 flow. Second operand 15 states and 2348 transitions. [2022-01-19 05:55:27,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 327 transitions, 1417 flow [2022-01-19 05:55:29,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 327 transitions, 1386 flow, removed 8 selfloop flow, removed 6 redundant places. [2022-01-19 05:55:29,044 INFO L242 Difference]: Finished difference. Result has 182 places, 165 transitions, 525 flow [2022-01-19 05:55:29,044 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=525, PETRI_PLACES=182, PETRI_TRANSITIONS=165} [2022-01-19 05:55:29,044 INFO L334 CegarLoopForPetriNet]: 161 programPoint places, 21 predicate places. [2022-01-19 05:55:29,044 INFO L470 AbstractCegarLoop]: Abstraction has has 182 places, 165 transitions, 525 flow [2022-01-19 05:55:29,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 144.0) internal successors, (1296), 9 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:55:29,045 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:55:29,045 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:55:29,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-19 05:55:29,045 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 05:55:29,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:55:29,045 INFO L85 PathProgramCache]: Analyzing trace with hash -907546208, now seen corresponding path program 1 times [2022-01-19 05:55:29,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:55:29,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920798422] [2022-01-19 05:55:29,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:55:29,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:55:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:55:29,110 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:55:29,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:55:29,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920798422] [2022-01-19 05:55:29,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920798422] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 05:55:29,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123222792] [2022-01-19 05:55:29,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:55:29,110 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 05:55:29,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 05:55:29,111 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 05:55:29,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-01-19 05:55:29,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:55:29,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-19 05:55:29,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 05:55:29,408 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:55:29,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 05:55:29,541 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:55:29,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123222792] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 05:55:29,541 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 05:55:29,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 25 [2022-01-19 05:55:29,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42731878] [2022-01-19 05:55:29,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 05:55:29,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-19 05:55:29,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:55:29,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-19 05:55:29,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2022-01-19 05:55:29,544 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 200 [2022-01-19 05:55:29,545 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 165 transitions, 525 flow. Second operand has 25 states, 25 states have (on average 143.4) internal successors, (3585), 25 states have internal predecessors, (3585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:55:29,545 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:55:29,545 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 200 [2022-01-19 05:55:29,545 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand