/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/goblint-regression/28-race_reach_74-tricky_address1_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 06:09:26,934 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 06:09:26,935 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 06:09:27,004 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 06:09:27,005 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 06:09:27,006 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 06:09:27,015 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 06:09:27,017 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 06:09:27,018 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 06:09:27,023 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 06:09:27,024 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 06:09:27,027 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 06:09:27,027 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 06:09:27,029 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 06:09:27,031 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 06:09:27,037 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 06:09:27,037 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 06:09:27,039 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 06:09:27,045 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 06:09:27,047 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 06:09:27,048 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 06:09:27,050 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 06:09:27,051 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 06:09:27,052 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 06:09:27,058 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 06:09:27,058 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 06:09:27,059 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 06:09:27,059 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 06:09:27,060 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 06:09:27,060 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 06:09:27,061 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 06:09:27,061 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 06:09:27,062 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 06:09:27,062 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 06:09:27,063 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 06:09:27,063 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 06:09:27,064 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 06:09:27,064 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 06:09:27,064 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 06:09:27,065 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 06:09:27,065 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 06:09:27,066 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 06:09:27,085 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 06:09:27,085 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 06:09:27,086 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 06:09:27,086 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 06:09:27,086 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 06:09:27,087 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 06:09:27,087 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 06:09:27,087 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 06:09:27,087 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 06:09:27,087 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 06:09:27,088 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 06:09:27,088 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 06:09:27,088 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 06:09:27,088 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 06:09:27,088 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 06:09:27,088 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 06:09:27,089 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 06:09:27,089 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 06:09:27,089 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 06:09:27,089 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 06:09:27,089 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 06:09:27,090 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 06:09:27,090 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 06:09:27,090 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 06:09:27,090 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 06:09:27,090 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 06:09:27,091 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 06:09:27,091 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 06:09:27,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 06:09:27,091 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 06:09:27,091 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 06:09:27,091 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 06:09:27,091 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 06:09:27,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 06:09:27,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 06:09:27,344 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 06:09:27,346 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 06:09:27,346 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 06:09:27,347 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_74-tricky_address1_racefree.i [2022-01-19 06:09:27,416 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f91607796/113a3376c3b041e5a5966432a74c7aa9/FLAG9125d89ae [2022-01-19 06:09:27,937 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 06:09:27,938 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_74-tricky_address1_racefree.i [2022-01-19 06:09:27,959 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f91607796/113a3376c3b041e5a5966432a74c7aa9/FLAG9125d89ae [2022-01-19 06:09:28,209 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f91607796/113a3376c3b041e5a5966432a74c7aa9 [2022-01-19 06:09:28,210 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 06:09:28,211 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 06:09:28,213 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 06:09:28,214 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 06:09:28,216 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 06:09:28,216 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 06:09:28" (1/1) ... [2022-01-19 06:09:28,217 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42f3ebab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:09:28, skipping insertion in model container [2022-01-19 06:09:28,217 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 06:09:28" (1/1) ... [2022-01-19 06:09:28,223 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 06:09:28,261 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 06:09:28,672 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_74-tricky_address1_racefree.i[41323,41336] [2022-01-19 06:09:28,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 06:09:28,711 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 06:09:28,763 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_74-tricky_address1_racefree.i[41323,41336] [2022-01-19 06:09:28,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 06:09:28,824 INFO L208 MainTranslator]: Completed translation [2022-01-19 06:09:28,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:09:28 WrapperNode [2022-01-19 06:09:28,825 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 06:09:28,826 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 06:09:28,826 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 06:09:28,826 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 06:09:28,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:09:28" (1/1) ... [2022-01-19 06:09:28,850 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:09:28" (1/1) ... [2022-01-19 06:09:28,879 INFO L137 Inliner]: procedures = 270, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 186 [2022-01-19 06:09:28,879 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 06:09:28,884 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 06:09:28,884 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 06:09:28,884 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 06:09:28,890 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:09:28" (1/1) ... [2022-01-19 06:09:28,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:09:28" (1/1) ... [2022-01-19 06:09:28,893 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:09:28" (1/1) ... [2022-01-19 06:09:28,894 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:09:28" (1/1) ... [2022-01-19 06:09:28,902 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:09:28" (1/1) ... [2022-01-19 06:09:28,907 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:09:28" (1/1) ... [2022-01-19 06:09:28,909 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:09:28" (1/1) ... [2022-01-19 06:09:28,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 06:09:28,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 06:09:28,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 06:09:28,926 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 06:09:28,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:09:28" (1/1) ... [2022-01-19 06:09:28,933 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 06:09:28,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:09:28,952 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 06:09:28,955 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 06:09:28,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 06:09:28,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 06:09:28,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 06:09:28,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 06:09:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-01-19 06:09:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 06:09:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-01-19 06:09:28,982 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-01-19 06:09:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 06:09:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 06:09:28,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 06:09:28,983 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 06:09:29,081 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 06:09:29,082 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 06:09:29,340 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 06:09:29,348 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 06:09:29,348 INFO L299 CfgBuilder]: Removed 23 assume(true) statements. [2022-01-19 06:09:29,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 06:09:29 BoogieIcfgContainer [2022-01-19 06:09:29,350 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 06:09:29,352 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 06:09:29,352 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 06:09:29,355 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 06:09:29,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 06:09:28" (1/3) ... [2022-01-19 06:09:29,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c3d37e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 06:09:29, skipping insertion in model container [2022-01-19 06:09:29,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:09:28" (2/3) ... [2022-01-19 06:09:29,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c3d37e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 06:09:29, skipping insertion in model container [2022-01-19 06:09:29,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 06:09:29" (3/3) ... [2022-01-19 06:09:29,357 INFO L111 eAbstractionObserver]: Analyzing ICFG 28-race_reach_74-tricky_address1_racefree.i [2022-01-19 06:09:29,362 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 06:09:29,362 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-19 06:09:29,363 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 06:09:29,414 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,414 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,415 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,415 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,415 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,415 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,415 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,416 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,416 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,416 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,417 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,417 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,417 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,417 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,418 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,418 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,418 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,418 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,419 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,419 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,419 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,419 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,420 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,420 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,420 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,420 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,420 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,421 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,421 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,421 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,421 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,421 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,422 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,422 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,422 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,422 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,423 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,423 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,423 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,423 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,424 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,424 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,424 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,424 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,424 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,425 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,425 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,426 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,426 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,426 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,426 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,426 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,427 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,427 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,427 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,427 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,427 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,427 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,428 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,428 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,428 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,428 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,428 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,428 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,429 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,429 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,429 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,429 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,429 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,430 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,430 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,430 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,430 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,430 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,430 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,431 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,431 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,431 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,431 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,431 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,432 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,432 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,432 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,432 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,432 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,432 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,434 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,434 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,434 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,434 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,434 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,434 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,435 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,435 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,435 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,435 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,435 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,436 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,436 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,436 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,436 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,436 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,437 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,437 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,437 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,437 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,437 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,437 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,441 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,441 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,441 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,442 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,442 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,445 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,445 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,445 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,446 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,446 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,446 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,446 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,446 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,447 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,447 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,447 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,447 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,447 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,447 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,448 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,448 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,448 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,448 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,448 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,448 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,448 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,449 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:09:29,452 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-01-19 06:09:29,494 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 06:09:29,500 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 06:09:29,500 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-19 06:09:29,512 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 169 places, 197 transitions, 402 flow [2022-01-19 06:09:29,614 INFO L129 PetriNetUnfolder]: 45/269 cut-off events. [2022-01-19 06:09:29,615 INFO L130 PetriNetUnfolder]: For 1/2 co-relation queries the response was YES. [2022-01-19 06:09:29,630 INFO L84 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 269 events. 45/269 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 860 event pairs, 0 based on Foata normal form. 0/218 useless extension candidates. Maximal degree in co-relation 147. Up to 8 conditions per place. [2022-01-19 06:09:29,630 INFO L82 GeneralOperation]: Start removeDead. Operand has 169 places, 197 transitions, 402 flow [2022-01-19 06:09:29,638 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 165 places, 192 transitions, 389 flow [2022-01-19 06:09:29,654 INFO L129 PetriNetUnfolder]: 12/127 cut-off events. [2022-01-19 06:09:29,654 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 06:09:29,655 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:09:29,655 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] [2022-01-19 06:09:29,661 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:09:29,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:09:29,666 INFO L85 PathProgramCache]: Analyzing trace with hash -706001553, now seen corresponding path program 1 times [2022-01-19 06:09:29,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:09:29,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771454943] [2022-01-19 06:09:29,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:09:29,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:09:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:09:29,914 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 06:09:29,915 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:09:29,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771454943] [2022-01-19 06:09:29,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771454943] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:09:29,917 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:09:29,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 06:09:29,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756125552] [2022-01-19 06:09:29,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:09:29,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 06:09:29,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:09:29,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 06:09:29,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 06:09:29,962 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 197 [2022-01-19 06:09:29,969 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 192 transitions, 389 flow. Second operand has 2 states, 2 states have (on average 167.0) internal successors, (334), 2 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:09:29,970 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:09:29,970 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 197 [2022-01-19 06:09:29,971 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:09:30,037 INFO L129 PetriNetUnfolder]: 4/221 cut-off events. [2022-01-19 06:09:30,038 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 06:09:30,042 INFO L84 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 221 events. 4/221 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 641 event pairs, 0 based on Foata normal form. 40/248 useless extension candidates. Maximal degree in co-relation 122. Up to 4 conditions per place. [2022-01-19 06:09:30,044 INFO L132 encePairwiseOnDemand]: 170/197 looper letters, 1 selfloop transitions, 0 changer transitions 1/163 dead transitions. [2022-01-19 06:09:30,044 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 163 transitions, 333 flow [2022-01-19 06:09:30,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 06:09:30,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 06:09:30,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 360 transitions. [2022-01-19 06:09:30,061 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9137055837563451 [2022-01-19 06:09:30,062 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 360 transitions. [2022-01-19 06:09:30,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 360 transitions. [2022-01-19 06:09:30,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:09:30,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 360 transitions. [2022-01-19 06:09:30,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 180.0) internal successors, (360), 2 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:09:30,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:09:30,085 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:09:30,087 INFO L186 Difference]: Start difference. First operand has 165 places, 192 transitions, 389 flow. Second operand 2 states and 360 transitions. [2022-01-19 06:09:30,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 163 transitions, 333 flow [2022-01-19 06:09:30,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 163 transitions, 333 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 06:09:30,096 INFO L242 Difference]: Finished difference. Result has 164 places, 162 transitions, 329 flow [2022-01-19 06:09:30,098 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=329, PETRI_PLACES=164, PETRI_TRANSITIONS=162} [2022-01-19 06:09:30,103 INFO L334 CegarLoopForPetriNet]: 165 programPoint places, -1 predicate places. [2022-01-19 06:09:30,103 INFO L470 AbstractCegarLoop]: Abstraction has has 164 places, 162 transitions, 329 flow [2022-01-19 06:09:30,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 167.0) internal successors, (334), 2 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:09:30,104 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:09:30,105 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] [2022-01-19 06:09:30,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 06:09:30,111 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:09:30,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:09:30,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1763164273, now seen corresponding path program 1 times [2022-01-19 06:09:30,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:09:30,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182446828] [2022-01-19 06:09:30,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:09:30,113 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:09:30,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:09:30,225 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 06:09:30,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:09:30,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182446828] [2022-01-19 06:09:30,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182446828] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:09:30,226 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:09:30,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 06:09:30,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299296416] [2022-01-19 06:09:30,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:09:30,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 06:09:30,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:09:30,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 06:09:30,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 06:09:30,231 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 197 [2022-01-19 06:09:30,232 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 162 transitions, 329 flow. Second operand has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:09:30,232 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:09:30,232 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 197 [2022-01-19 06:09:30,232 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:09:30,286 INFO L129 PetriNetUnfolder]: 4/224 cut-off events. [2022-01-19 06:09:30,287 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 06:09:30,288 INFO L84 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 224 events. 4/224 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 638 event pairs, 0 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 239. Up to 9 conditions per place. [2022-01-19 06:09:30,289 INFO L132 encePairwiseOnDemand]: 194/197 looper letters, 10 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2022-01-19 06:09:30,289 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 166 transitions, 361 flow [2022-01-19 06:09:30,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 06:09:30,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 06:09:30,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions. [2022-01-19 06:09:30,292 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8291032148900169 [2022-01-19 06:09:30,292 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 490 transitions. [2022-01-19 06:09:30,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 490 transitions. [2022-01-19 06:09:30,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:09:30,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 490 transitions. [2022-01-19 06:09:30,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:09:30,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:09:30,298 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:09:30,298 INFO L186 Difference]: Start difference. First operand has 164 places, 162 transitions, 329 flow. Second operand 3 states and 490 transitions. [2022-01-19 06:09:30,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 166 transitions, 361 flow [2022-01-19 06:09:30,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 166 transitions, 361 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 06:09:30,307 INFO L242 Difference]: Finished difference. Result has 166 places, 163 transitions, 341 flow [2022-01-19 06:09:30,308 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=341, PETRI_PLACES=166, PETRI_TRANSITIONS=163} [2022-01-19 06:09:30,309 INFO L334 CegarLoopForPetriNet]: 165 programPoint places, 1 predicate places. [2022-01-19 06:09:30,310 INFO L470 AbstractCegarLoop]: Abstraction has has 166 places, 163 transitions, 341 flow [2022-01-19 06:09:30,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:09:30,310 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:09:30,311 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] [2022-01-19 06:09:30,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 06:09:30,313 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:09:30,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:09:30,314 INFO L85 PathProgramCache]: Analyzing trace with hash -2008438335, now seen corresponding path program 1 times [2022-01-19 06:09:30,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:09:30,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884017711] [2022-01-19 06:09:30,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:09:30,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:09:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:09:30,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:09:30,423 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:09:30,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884017711] [2022-01-19 06:09:30,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884017711] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:09:30,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489230156] [2022-01-19 06:09:30,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:09:30,424 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:09:30,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:09:30,431 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 06:09:30,456 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 06:09:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:09:30,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-19 06:09:30,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:09:30,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:09:30,678 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 06:09:30,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489230156] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:09:30,679 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 06:09:30,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-01-19 06:09:30,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478852178] [2022-01-19 06:09:30,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:09:30,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 06:09:30,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:09:30,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 06:09:30,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-19 06:09:30,687 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 197 [2022-01-19 06:09:30,688 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 163 transitions, 341 flow. Second operand has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:09:30,688 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:09:30,688 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 197 [2022-01-19 06:09:30,688 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:09:30,727 INFO L129 PetriNetUnfolder]: 3/170 cut-off events. [2022-01-19 06:09:30,727 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 06:09:30,728 INFO L84 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 170 events. 3/170 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 322 event pairs, 0 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 188. Up to 6 conditions per place. [2022-01-19 06:09:30,729 INFO L132 encePairwiseOnDemand]: 194/197 looper letters, 8 selfloop transitions, 2 changer transitions 0/165 dead transitions. [2022-01-19 06:09:30,729 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 165 transitions, 365 flow [2022-01-19 06:09:30,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 06:09:30,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 06:09:30,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 488 transitions. [2022-01-19 06:09:30,731 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8257191201353637 [2022-01-19 06:09:30,731 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 488 transitions. [2022-01-19 06:09:30,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 488 transitions. [2022-01-19 06:09:30,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:09:30,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 488 transitions. [2022-01-19 06:09:30,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:09:30,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:09:30,735 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:09:30,735 INFO L186 Difference]: Start difference. First operand has 166 places, 163 transitions, 341 flow. Second operand 3 states and 488 transitions. [2022-01-19 06:09:30,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 165 transitions, 365 flow [2022-01-19 06:09:30,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 165 transitions, 363 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 06:09:30,741 INFO L242 Difference]: Finished difference. Result has 168 places, 163 transitions, 347 flow [2022-01-19 06:09:30,741 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=347, PETRI_PLACES=168, PETRI_TRANSITIONS=163} [2022-01-19 06:09:30,743 INFO L334 CegarLoopForPetriNet]: 165 programPoint places, 3 predicate places. [2022-01-19 06:09:30,744 INFO L470 AbstractCegarLoop]: Abstraction has has 168 places, 163 transitions, 347 flow [2022-01-19 06:09:30,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:09:30,744 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:09:30,744 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] [2022-01-19 06:09:30,770 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 06:09:30,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:09:30,960 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:09:30,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:09:30,960 INFO L85 PathProgramCache]: Analyzing trace with hash -478841000, now seen corresponding path program 1 times [2022-01-19 06:09:30,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:09:30,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856704504] [2022-01-19 06:09:30,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:09:30,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:09:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:09:31,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:09:31,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:09:31,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856704504] [2022-01-19 06:09:31,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856704504] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:09:31,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482438616] [2022-01-19 06:09:31,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:09:31,044 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:09:31,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:09:31,045 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 06:09:31,047 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 06:09:31,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:09:31,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-19 06:09:31,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:09:31,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:09:31,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:09:31,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:09:31,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482438616] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:09:31,417 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:09:31,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-19 06:09:31,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402962819] [2022-01-19 06:09:31,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:09:31,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 06:09:31,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:09:31,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 06:09:31,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-01-19 06:09:31,424 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 197 [2022-01-19 06:09:31,426 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 163 transitions, 347 flow. Second operand has 10 states, 10 states have (on average 160.1) internal successors, (1601), 10 states have internal predecessors, (1601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:09:31,426 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:09:31,426 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 197 [2022-01-19 06:09:31,426 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:09:31,522 INFO L129 PetriNetUnfolder]: 3/177 cut-off events. [2022-01-19 06:09:31,523 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 06:09:31,523 INFO L84 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 177 events. 3/177 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 317 event pairs, 0 based on Foata normal form. 2/173 useless extension candidates. Maximal degree in co-relation 209. Up to 6 conditions per place. [2022-01-19 06:09:31,524 INFO L132 encePairwiseOnDemand]: 191/197 looper letters, 11 selfloop transitions, 9 changer transitions 0/173 dead transitions. [2022-01-19 06:09:31,524 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 173 transitions, 409 flow [2022-01-19 06:09:31,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 06:09:31,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 06:09:31,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1444 transitions. [2022-01-19 06:09:31,558 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.81443880428652 [2022-01-19 06:09:31,558 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1444 transitions. [2022-01-19 06:09:31,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1444 transitions. [2022-01-19 06:09:31,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:09:31,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1444 transitions. [2022-01-19 06:09:31,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 160.44444444444446) internal successors, (1444), 9 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:09:31,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 197.0) internal successors, (1970), 10 states have internal predecessors, (1970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:09:31,568 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 197.0) internal successors, (1970), 10 states have internal predecessors, (1970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:09:31,568 INFO L186 Difference]: Start difference. First operand has 168 places, 163 transitions, 347 flow. Second operand 9 states and 1444 transitions. [2022-01-19 06:09:31,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 173 transitions, 409 flow [2022-01-19 06:09:31,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 173 transitions, 405 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 06:09:31,572 INFO L242 Difference]: Finished difference. Result has 177 places, 169 transitions, 393 flow [2022-01-19 06:09:31,572 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=393, PETRI_PLACES=177, PETRI_TRANSITIONS=169} [2022-01-19 06:09:31,573 INFO L334 CegarLoopForPetriNet]: 165 programPoint places, 12 predicate places. [2022-01-19 06:09:31,573 INFO L470 AbstractCegarLoop]: Abstraction has has 177 places, 169 transitions, 393 flow [2022-01-19 06:09:31,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 160.1) internal successors, (1601), 10 states have internal predecessors, (1601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:09:31,575 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:09:31,575 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:09:31,600 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 06:09:31,791 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,SelfDestructingSolverStorable3 [2022-01-19 06:09:31,792 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:09:31,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:09:31,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1620698456, now seen corresponding path program 2 times [2022-01-19 06:09:31,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:09:31,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983812517] [2022-01-19 06:09:31,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:09:31,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:09:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:09:31,861 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-19 06:09:31,862 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:09:31,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983812517] [2022-01-19 06:09:31,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983812517] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:09:31,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085361138] [2022-01-19 06:09:31,862 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 06:09:31,862 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:09:31,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:09:31,863 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 06:09:31,865 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 06:09:31,944 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 06:09:31,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:09:31,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 06:09:31,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:09:32,125 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:09:32,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:09:32,312 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:09:32,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085361138] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:09:32,313 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:09:32,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2022-01-19 06:09:32,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399456554] [2022-01-19 06:09:32,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:09:32,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 06:09:32,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:09:32,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 06:09:32,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-01-19 06:09:32,318 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 197 [2022-01-19 06:09:32,321 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 169 transitions, 393 flow. Second operand has 19 states, 19 states have (on average 154.05263157894737) internal successors, (2927), 19 states have internal predecessors, (2927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:09:32,321 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:09:32,321 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 197 [2022-01-19 06:09:32,321 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:09:32,542 INFO L129 PetriNetUnfolder]: 2/143 cut-off events. [2022-01-19 06:09:32,542 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-01-19 06:09:32,542 INFO L84 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 143 events. 2/143 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 5/145 useless extension candidates. Maximal degree in co-relation 248. Up to 11 conditions per place. [2022-01-19 06:09:32,543 INFO L132 encePairwiseOnDemand]: 186/197 looper letters, 23 selfloop transitions, 25 changer transitions 32/141 dead transitions. [2022-01-19 06:09:32,543 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 141 transitions, 491 flow [2022-01-19 06:09:32,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-19 06:09:32,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-01-19 06:09:32,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 3828 transitions. [2022-01-19 06:09:32,551 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7772588832487309 [2022-01-19 06:09:32,551 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 3828 transitions. [2022-01-19 06:09:32,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 3828 transitions. [2022-01-19 06:09:32,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:09:32,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 3828 transitions. [2022-01-19 06:09:32,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 153.12) internal successors, (3828), 25 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:09:32,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 197.0) internal successors, (5122), 26 states have internal predecessors, (5122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:09:32,569 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 197.0) internal successors, (5122), 26 states have internal predecessors, (5122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:09:32,569 INFO L186 Difference]: Start difference. First operand has 177 places, 169 transitions, 393 flow. Second operand 25 states and 3828 transitions. [2022-01-19 06:09:32,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 141 transitions, 491 flow [2022-01-19 06:09:32,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 141 transitions, 475 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-01-19 06:09:32,575 INFO L242 Difference]: Finished difference. Result has 151 places, 96 transitions, 350 flow [2022-01-19 06:09:32,575 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=350, PETRI_PLACES=151, PETRI_TRANSITIONS=96} [2022-01-19 06:09:32,577 INFO L334 CegarLoopForPetriNet]: 165 programPoint places, -14 predicate places. [2022-01-19 06:09:32,577 INFO L470 AbstractCegarLoop]: Abstraction has has 151 places, 96 transitions, 350 flow [2022-01-19 06:09:32,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 154.05263157894737) internal successors, (2927), 19 states have internal predecessors, (2927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:09:32,580 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:09:32,580 INFO L254 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:09:32,610 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 06:09:32,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:09:32,804 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:09:32,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:09:32,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1862165553, now seen corresponding path program 1 times [2022-01-19 06:09:32,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:09:32,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310812436] [2022-01-19 06:09:32,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:09:32,805 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:09:32,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:09:32,969 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:09:32,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:09:32,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310812436] [2022-01-19 06:09:32,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310812436] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:09:32,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329355073] [2022-01-19 06:09:32,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:09:32,970 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:09:32,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:09:32,972 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 06:09:33,003 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 06:09:33,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:09:33,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-19 06:09:33,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:09:33,252 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:09:33,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:09:33,465 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:09:33,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329355073] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:09:33,466 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:09:33,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-01-19 06:09:33,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083828267] [2022-01-19 06:09:33,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:09:33,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-19 06:09:33,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:09:33,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-19 06:09:33,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-01-19 06:09:33,476 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 197 [2022-01-19 06:09:33,480 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 96 transitions, 350 flow. Second operand has 23 states, 23 states have (on average 160.43478260869566) internal successors, (3690), 23 states have internal predecessors, (3690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:09:33,480 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:09:33,480 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 197 [2022-01-19 06:09:33,480 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:09:33,761 INFO L129 PetriNetUnfolder]: 1/126 cut-off events. [2022-01-19 06:09:33,761 INFO L130 PetriNetUnfolder]: For 110/110 co-relation queries the response was YES. [2022-01-19 06:09:33,761 INFO L84 FinitePrefix]: Finished finitePrefix Result has 321 conditions, 126 events. 1/126 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 20 event pairs, 0 based on Foata normal form. 3/129 useless extension candidates. Maximal degree in co-relation 308. Up to 17 conditions per place. [2022-01-19 06:09:33,762 INFO L132 encePairwiseOnDemand]: 191/197 looper letters, 25 selfloop transitions, 30 changer transitions 0/122 dead transitions. [2022-01-19 06:09:33,762 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 122 transitions, 606 flow [2022-01-19 06:09:33,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-19 06:09:33,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-01-19 06:09:33,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 4798 transitions. [2022-01-19 06:09:33,773 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.811844331641286 [2022-01-19 06:09:33,773 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 4798 transitions. [2022-01-19 06:09:33,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 4798 transitions. [2022-01-19 06:09:33,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:09:33,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 4798 transitions. [2022-01-19 06:09:33,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 159.93333333333334) internal successors, (4798), 30 states have internal predecessors, (4798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:09:33,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 197.0) internal successors, (6107), 31 states have internal predecessors, (6107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:09:33,798 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 197.0) internal successors, (6107), 31 states have internal predecessors, (6107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:09:33,798 INFO L186 Difference]: Start difference. First operand has 151 places, 96 transitions, 350 flow. Second operand 30 states and 4798 transitions. [2022-01-19 06:09:33,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 122 transitions, 606 flow [2022-01-19 06:09:33,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 122 transitions, 570 flow, removed 9 selfloop flow, removed 9 redundant places. [2022-01-19 06:09:33,807 INFO L242 Difference]: Finished difference. Result has 144 places, 106 transitions, 472 flow [2022-01-19 06:09:33,807 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=472, PETRI_PLACES=144, PETRI_TRANSITIONS=106} [2022-01-19 06:09:33,810 INFO L334 CegarLoopForPetriNet]: 165 programPoint places, -21 predicate places. [2022-01-19 06:09:33,810 INFO L470 AbstractCegarLoop]: Abstraction has has 144 places, 106 transitions, 472 flow [2022-01-19 06:09:33,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 160.43478260869566) internal successors, (3690), 23 states have internal predecessors, (3690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:09:33,811 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:09:33,812 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:09:33,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-01-19 06:09:34,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:09:34,024 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:09:34,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:09:34,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1793341567, now seen corresponding path program 2 times [2022-01-19 06:09:34,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:09:34,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431286285] [2022-01-19 06:09:34,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:09:34,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:09:34,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:09:34,378 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:09:34,379 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:09:34,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431286285] [2022-01-19 06:09:34,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431286285] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:09:34,379 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:09:34,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-19 06:09:34,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795712973] [2022-01-19 06:09:34,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:09:34,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-19 06:09:34,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:09:34,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-19 06:09:34,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-01-19 06:09:34,383 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 197 [2022-01-19 06:09:34,385 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 106 transitions, 472 flow. Second operand has 13 states, 13 states have (on average 113.15384615384616) internal successors, (1471), 13 states have internal predecessors, (1471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:09:34,385 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:09:34,385 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 197 [2022-01-19 06:09:34,385 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:09:34,613 INFO L129 PetriNetUnfolder]: 6/160 cut-off events. [2022-01-19 06:09:34,614 INFO L130 PetriNetUnfolder]: For 118/118 co-relation queries the response was YES. [2022-01-19 06:09:34,614 INFO L84 FinitePrefix]: Finished finitePrefix Result has 394 conditions, 160 events. 6/160 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 190 event pairs, 0 based on Foata normal form. 3/162 useless extension candidates. Maximal degree in co-relation 377. Up to 16 conditions per place. [2022-01-19 06:09:34,615 INFO L132 encePairwiseOnDemand]: 186/197 looper letters, 24 selfloop transitions, 7 changer transitions 10/119 dead transitions. [2022-01-19 06:09:34,615 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 119 transitions, 580 flow [2022-01-19 06:09:34,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 06:09:34,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 06:09:34,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1597 transitions. [2022-01-19 06:09:34,620 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.579042784626541 [2022-01-19 06:09:34,620 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1597 transitions. [2022-01-19 06:09:34,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1597 transitions. [2022-01-19 06:09:34,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:09:34,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1597 transitions. [2022-01-19 06:09:34,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 114.07142857142857) internal successors, (1597), 14 states have internal predecessors, (1597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:09:34,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 197.0) internal successors, (2955), 15 states have internal predecessors, (2955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:09:34,642 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 197.0) internal successors, (2955), 15 states have internal predecessors, (2955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:09:34,642 INFO L186 Difference]: Start difference. First operand has 144 places, 106 transitions, 472 flow. Second operand 14 states and 1597 transitions. [2022-01-19 06:09:34,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 119 transitions, 580 flow [2022-01-19 06:09:34,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 119 transitions, 536 flow, removed 4 selfloop flow, removed 18 redundant places. [2022-01-19 06:09:34,648 INFO L242 Difference]: Finished difference. Result has 146 places, 107 transitions, 468 flow [2022-01-19 06:09:34,649 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=468, PETRI_PLACES=146, PETRI_TRANSITIONS=107} [2022-01-19 06:09:34,649 INFO L334 CegarLoopForPetriNet]: 165 programPoint places, -19 predicate places. [2022-01-19 06:09:34,650 INFO L470 AbstractCegarLoop]: Abstraction has has 146 places, 107 transitions, 468 flow [2022-01-19 06:09:34,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 113.15384615384616) internal successors, (1471), 13 states have internal predecessors, (1471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:09:34,650 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:09:34,651 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 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] [2022-01-19 06:09:34,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 06:09:34,651 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:09:34,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:09:34,651 INFO L85 PathProgramCache]: Analyzing trace with hash 340845936, now seen corresponding path program 1 times [2022-01-19 06:09:34,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:09:34,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961604530] [2022-01-19 06:09:34,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:09:34,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:09:34,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:09:34,994 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:09:34,994 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:09:34,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961604530] [2022-01-19 06:09:34,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961604530] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:09:34,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226085702] [2022-01-19 06:09:34,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:09:34,995 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:09:34,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:09:35,000 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 06:09:35,027 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 06:09:35,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:09:35,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-19 06:09:35,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:09:35,189 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-01-19 06:09:35,615 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:09:35,615 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:09:35,669 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:09:35,854 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:09:35,874 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-01-19 06:09:35,920 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:09:35,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:09:35,971 WARN L838 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_~p~0#1.offset| Int) (v_ArrVal_224 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_224) |c_t_funThread1of1ForFork0_~p~0#1.base|) |t_funThread1of1ForFork0_~p~0#1.offset|) 0)) is different from false [2022-01-19 06:09:36,043 WARN L838 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_~p~0#1.offset| Int) (v_ArrVal_224 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_224) |c_~#a~0.base|) |t_funThread1of1ForFork0_~p~0#1.offset|) 0)) is different from false [2022-01-19 06:09:36,731 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-01-19 06:09:36,756 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:09:36,757 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-19 06:09:36,772 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 4 not checked. [2022-01-19 06:09:36,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226085702] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:09:36,773 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:09:36,773 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 26 [2022-01-19 06:09:36,773 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772900107] [2022-01-19 06:09:36,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:09:36,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-19 06:09:36,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:09:36,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-19 06:09:36,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=469, Unknown=2, NotChecked=90, Total=650 [2022-01-19 06:09:36,777 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 197 [2022-01-19 06:09:36,779 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 107 transitions, 468 flow. Second operand has 26 states, 26 states have (on average 113.5) internal successors, (2951), 26 states have internal predecessors, (2951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:09:36,779 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:09:36,779 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 197 [2022-01-19 06:09:36,779 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:09:56,879 WARN L228 SmtUtils]: Spent 20.03s on a formula simplification. DAG size of input: 26 DAG size of output: 21 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:10:10,945 WARN L228 SmtUtils]: Spent 14.04s on a formula simplification. DAG size of input: 30 DAG size of output: 19 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:10:21,036 WARN L228 SmtUtils]: Spent 10.02s on a formula simplification. DAG size of input: 26 DAG size of output: 17 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:10:21,176 INFO L129 PetriNetUnfolder]: 1/159 cut-off events. [2022-01-19 06:10:21,177 INFO L130 PetriNetUnfolder]: For 167/169 co-relation queries the response was YES. [2022-01-19 06:10:21,177 INFO L84 FinitePrefix]: Finished finitePrefix Result has 410 conditions, 159 events. 1/159 cut-off events. For 167/169 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 160 event pairs, 0 based on Foata normal form. 2/160 useless extension candidates. Maximal degree in co-relation 385. Up to 16 conditions per place. [2022-01-19 06:10:21,178 INFO L132 encePairwiseOnDemand]: 184/197 looper letters, 19 selfloop transitions, 10 changer transitions 14/121 dead transitions. [2022-01-19 06:10:21,178 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 121 transitions, 616 flow [2022-01-19 06:10:21,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-19 06:10:21,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-01-19 06:10:21,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2265 transitions. [2022-01-19 06:10:21,184 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5748730964467005 [2022-01-19 06:10:21,184 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2265 transitions. [2022-01-19 06:10:21,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2265 transitions. [2022-01-19 06:10:21,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:10:21,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2265 transitions. [2022-01-19 06:10:21,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 113.25) internal successors, (2265), 20 states have internal predecessors, (2265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:10:21,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 197.0) internal successors, (4137), 21 states have internal predecessors, (4137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:10:21,198 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 197.0) internal successors, (4137), 21 states have internal predecessors, (4137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:10:21,198 INFO L186 Difference]: Start difference. First operand has 146 places, 107 transitions, 468 flow. Second operand 20 states and 2265 transitions. [2022-01-19 06:10:21,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 121 transitions, 616 flow [2022-01-19 06:10:21,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 121 transitions, 562 flow, removed 20 selfloop flow, removed 12 redundant places. [2022-01-19 06:10:21,203 INFO L242 Difference]: Finished difference. Result has 155 places, 107 transitions, 476 flow [2022-01-19 06:10:21,203 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=476, PETRI_PLACES=155, PETRI_TRANSITIONS=107} [2022-01-19 06:10:21,205 INFO L334 CegarLoopForPetriNet]: 165 programPoint places, -10 predicate places. [2022-01-19 06:10:21,205 INFO L470 AbstractCegarLoop]: Abstraction has has 155 places, 107 transitions, 476 flow [2022-01-19 06:10:21,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 113.5) internal successors, (2951), 26 states have internal predecessors, (2951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:10:21,206 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:10:21,207 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 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] [2022-01-19 06:10:21,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-19 06:10:21,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:10:21,407 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:10:21,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:10:21,408 INFO L85 PathProgramCache]: Analyzing trace with hash 339808604, now seen corresponding path program 2 times [2022-01-19 06:10:21,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:10:21,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903750652] [2022-01-19 06:10:21,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:10:21,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:10:21,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:10:21,658 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:10:21,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:10:21,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903750652] [2022-01-19 06:10:21,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903750652] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:10:21,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065576382] [2022-01-19 06:10:21,659 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 06:10:21,659 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:10:21,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:10:21,664 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 06:10:21,665 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 06:10:21,762 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 06:10:21,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:10:21,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-19 06:10:21,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:10:21,814 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-01-19 06:10:22,250 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:10:22,251 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:10:22,308 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:10:22,459 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:10:22,495 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-01-19 06:10:22,532 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:10:22,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:10:22,590 WARN L838 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_~p~0#1.offset| Int) (v_ArrVal_289 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_289) |c_t_funThread1of1ForFork0_~p~0#1.base|) |t_funThread1of1ForFork0_~p~0#1.offset|) 0)) is different from false [2022-01-19 06:10:22,619 WARN L838 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_~p~0#1.offset| Int) (v_ArrVal_289 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_289) |c_~#a~0.base|) |t_funThread1of1ForFork0_~p~0#1.offset|) 0)) is different from false [2022-01-19 06:10:23,222 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-01-19 06:10:23,245 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:10:23,245 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-19 06:10:23,260 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 4 not checked. [2022-01-19 06:10:23,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065576382] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:10:23,261 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:10:23,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 26 [2022-01-19 06:10:23,261 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665308545] [2022-01-19 06:10:23,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:10:23,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-19 06:10:23,261 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:10:23,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-19 06:10:23,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=469, Unknown=2, NotChecked=90, Total=650 [2022-01-19 06:10:23,265 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 197 [2022-01-19 06:10:23,267 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 107 transitions, 476 flow. Second operand has 26 states, 26 states have (on average 113.5) internal successors, (2951), 26 states have internal predecessors, (2951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:10:23,267 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:10:23,268 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 197 [2022-01-19 06:10:23,268 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:10:45,347 WARN L228 SmtUtils]: Spent 22.02s on a formula simplification. DAG size of input: 26 DAG size of output: 21 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:10:57,398 WARN L228 SmtUtils]: Spent 12.02s on a formula simplification. DAG size of input: 30 DAG size of output: 19 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:11:07,424 WARN L228 SmtUtils]: Spent 10.02s on a formula simplification. DAG size of input: 26 DAG size of output: 17 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:11:07,524 INFO L129 PetriNetUnfolder]: 1/124 cut-off events. [2022-01-19 06:11:07,524 INFO L130 PetriNetUnfolder]: For 142/142 co-relation queries the response was YES. [2022-01-19 06:11:07,525 INFO L84 FinitePrefix]: Finished finitePrefix Result has 339 conditions, 124 events. 1/124 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 21 event pairs, 0 based on Foata normal form. 1/125 useless extension candidates. Maximal degree in co-relation 312. Up to 16 conditions per place. [2022-01-19 06:11:07,525 INFO L132 encePairwiseOnDemand]: 185/197 looper letters, 0 selfloop transitions, 0 changer transitions 105/105 dead transitions. [2022-01-19 06:11:07,525 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 105 transitions, 524 flow [2022-01-19 06:11:07,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 06:11:07,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 06:11:07,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1583 transitions. [2022-01-19 06:11:07,528 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5739666424945613 [2022-01-19 06:11:07,528 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1583 transitions. [2022-01-19 06:11:07,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1583 transitions. [2022-01-19 06:11:07,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:11:07,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1583 transitions. [2022-01-19 06:11:07,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 113.07142857142857) internal successors, (1583), 14 states have internal predecessors, (1583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:07,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 197.0) internal successors, (2955), 15 states have internal predecessors, (2955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:07,535 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 197.0) internal successors, (2955), 15 states have internal predecessors, (2955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:07,535 INFO L186 Difference]: Start difference. First operand has 155 places, 107 transitions, 476 flow. Second operand 14 states and 1583 transitions. [2022-01-19 06:11:07,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 105 transitions, 524 flow [2022-01-19 06:11:07,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 105 transitions, 488 flow, removed 8 selfloop flow, removed 15 redundant places. [2022-01-19 06:11:07,539 INFO L242 Difference]: Finished difference. Result has 142 places, 0 transitions, 0 flow [2022-01-19 06:11:07,539 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=0, PETRI_PLACES=142, PETRI_TRANSITIONS=0} [2022-01-19 06:11:07,539 INFO L334 CegarLoopForPetriNet]: 165 programPoint places, -23 predicate places. [2022-01-19 06:11:07,540 INFO L470 AbstractCegarLoop]: Abstraction has has 142 places, 0 transitions, 0 flow [2022-01-19 06:11:07,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 113.5) internal successors, (2951), 26 states have internal predecessors, (2951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:07,543 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-01-19 06:11:07,543 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2022-01-19 06:11:07,544 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2022-01-19 06:11:07,575 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 06:11:07,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:11:07,770 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1] [2022-01-19 06:11:07,771 INFO L309 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2022-01-19 06:11:07,776 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2022-01-19 06:11:07,776 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 06:11:07,776 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-19 06:11:07,782 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 169 places, 197 transitions, 402 flow [2022-01-19 06:11:07,801 INFO L129 PetriNetUnfolder]: 45/269 cut-off events. [2022-01-19 06:11:07,802 INFO L130 PetriNetUnfolder]: For 1/2 co-relation queries the response was YES. [2022-01-19 06:11:07,803 INFO L84 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 269 events. 45/269 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 860 event pairs, 0 based on Foata normal form. 0/218 useless extension candidates. Maximal degree in co-relation 147. Up to 8 conditions per place. [2022-01-19 06:11:07,803 INFO L82 GeneralOperation]: Start removeDead. Operand has 169 places, 197 transitions, 402 flow [2022-01-19 06:11:07,807 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 165 places, 192 transitions, 389 flow [2022-01-19 06:11:07,813 INFO L129 PetriNetUnfolder]: 12/130 cut-off events. [2022-01-19 06:11:07,813 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 06:11:07,813 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:11:07,813 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] [2022-01-19 06:11:07,813 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-19 06:11:07,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:11:07,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1893756395, now seen corresponding path program 1 times [2022-01-19 06:11:07,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:11:07,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123706791] [2022-01-19 06:11:07,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:11:07,814 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:11:07,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:11:07,828 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 06:11:07,829 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:11:07,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123706791] [2022-01-19 06:11:07,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123706791] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:11:07,829 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:11:07,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 06:11:07,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527139575] [2022-01-19 06:11:07,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:11:07,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 06:11:07,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:11:07,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 06:11:07,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 06:11:07,832 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 197 [2022-01-19 06:11:07,832 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 192 transitions, 389 flow. Second operand has 2 states, 2 states have (on average 167.0) internal successors, (334), 2 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:07,832 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:11:07,832 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 197 [2022-01-19 06:11:07,832 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:11:07,850 INFO L129 PetriNetUnfolder]: 4/221 cut-off events. [2022-01-19 06:11:07,850 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 06:11:07,851 INFO L84 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 221 events. 4/221 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 641 event pairs, 0 based on Foata normal form. 40/248 useless extension candidates. Maximal degree in co-relation 122. Up to 4 conditions per place. [2022-01-19 06:11:07,851 INFO L132 encePairwiseOnDemand]: 170/197 looper letters, 1 selfloop transitions, 0 changer transitions 1/163 dead transitions. [2022-01-19 06:11:07,851 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 163 transitions, 333 flow [2022-01-19 06:11:07,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 06:11:07,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 06:11:07,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 360 transitions. [2022-01-19 06:11:07,852 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9137055837563451 [2022-01-19 06:11:07,852 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 360 transitions. [2022-01-19 06:11:07,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 360 transitions. [2022-01-19 06:11:07,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:11:07,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 360 transitions. [2022-01-19 06:11:07,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 180.0) internal successors, (360), 2 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:07,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:07,854 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:07,854 INFO L186 Difference]: Start difference. First operand has 165 places, 192 transitions, 389 flow. Second operand 2 states and 360 transitions. [2022-01-19 06:11:07,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 163 transitions, 333 flow [2022-01-19 06:11:07,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 163 transitions, 333 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 06:11:07,856 INFO L242 Difference]: Finished difference. Result has 164 places, 162 transitions, 329 flow [2022-01-19 06:11:07,857 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=329, PETRI_PLACES=164, PETRI_TRANSITIONS=162} [2022-01-19 06:11:07,858 INFO L334 CegarLoopForPetriNet]: 165 programPoint places, -1 predicate places. [2022-01-19 06:11:07,858 INFO L470 AbstractCegarLoop]: Abstraction has has 164 places, 162 transitions, 329 flow [2022-01-19 06:11:07,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 167.0) internal successors, (334), 2 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:07,858 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:11:07,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] [2022-01-19 06:11:07,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 06:11:07,858 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-19 06:11:07,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:11:07,859 INFO L85 PathProgramCache]: Analyzing trace with hash -932142378, now seen corresponding path program 1 times [2022-01-19 06:11:07,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:11:07,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075947385] [2022-01-19 06:11:07,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:11:07,859 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:11:07,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:11:07,874 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 06:11:07,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:11:07,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075947385] [2022-01-19 06:11:07,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075947385] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:11:07,875 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:11:07,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 06:11:07,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334563114] [2022-01-19 06:11:07,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:11:07,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 06:11:07,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:11:07,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 06:11:07,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 06:11:07,877 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 197 [2022-01-19 06:11:07,878 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 162 transitions, 329 flow. Second operand has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:07,878 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:11:07,878 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 197 [2022-01-19 06:11:07,878 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:11:07,905 INFO L129 PetriNetUnfolder]: 4/224 cut-off events. [2022-01-19 06:11:07,905 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 06:11:07,906 INFO L84 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 224 events. 4/224 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 638 event pairs, 0 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 239. Up to 9 conditions per place. [2022-01-19 06:11:07,906 INFO L132 encePairwiseOnDemand]: 194/197 looper letters, 10 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2022-01-19 06:11:07,906 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 166 transitions, 361 flow [2022-01-19 06:11:07,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 06:11:07,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 06:11:07,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions. [2022-01-19 06:11:07,908 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8291032148900169 [2022-01-19 06:11:07,908 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 490 transitions. [2022-01-19 06:11:07,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 490 transitions. [2022-01-19 06:11:07,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:11:07,908 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 490 transitions. [2022-01-19 06:11:07,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:07,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:07,910 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:07,910 INFO L186 Difference]: Start difference. First operand has 164 places, 162 transitions, 329 flow. Second operand 3 states and 490 transitions. [2022-01-19 06:11:07,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 166 transitions, 361 flow [2022-01-19 06:11:07,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 166 transitions, 361 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 06:11:07,912 INFO L242 Difference]: Finished difference. Result has 166 places, 163 transitions, 341 flow [2022-01-19 06:11:07,913 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=341, PETRI_PLACES=166, PETRI_TRANSITIONS=163} [2022-01-19 06:11:07,914 INFO L334 CegarLoopForPetriNet]: 165 programPoint places, 1 predicate places. [2022-01-19 06:11:07,914 INFO L470 AbstractCegarLoop]: Abstraction has has 166 places, 163 transitions, 341 flow [2022-01-19 06:11:07,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:07,914 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:11:07,914 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] [2022-01-19 06:11:07,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 06:11:07,915 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-19 06:11:07,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:11:07,915 INFO L85 PathProgramCache]: Analyzing trace with hash -408777690, now seen corresponding path program 1 times [2022-01-19 06:11:07,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:11:07,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044213809] [2022-01-19 06:11:07,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:11:07,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:11:07,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:11:07,945 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 06:11:07,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:11:07,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044213809] [2022-01-19 06:11:07,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044213809] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:11:07,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219610690] [2022-01-19 06:11:07,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:11:07,946 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:11:07,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:11:07,947 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 06:11:07,948 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 06:11:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:11:08,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-19 06:11:08,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:11:08,105 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 06:11:08,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:11:08,192 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 06:11:08,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219610690] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:11:08,193 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:11:08,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-19 06:11:08,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940913543] [2022-01-19 06:11:08,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:11:08,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 06:11:08,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:11:08,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 06:11:08,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-01-19 06:11:08,195 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 197 [2022-01-19 06:11:08,197 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 163 transitions, 341 flow. Second operand has 10 states, 10 states have (on average 160.1) internal successors, (1601), 10 states have internal predecessors, (1601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:08,197 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:11:08,197 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 197 [2022-01-19 06:11:08,197 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:11:08,260 INFO L129 PetriNetUnfolder]: 4/231 cut-off events. [2022-01-19 06:11:08,260 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 06:11:08,261 INFO L84 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 231 events. 4/231 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 633 event pairs, 0 based on Foata normal form. 2/222 useless extension candidates. Maximal degree in co-relation 260. Up to 6 conditions per place. [2022-01-19 06:11:08,261 INFO L132 encePairwiseOnDemand]: 191/197 looper letters, 11 selfloop transitions, 9 changer transitions 0/173 dead transitions. [2022-01-19 06:11:08,261 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 173 transitions, 403 flow [2022-01-19 06:11:08,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 06:11:08,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 06:11:08,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1444 transitions. [2022-01-19 06:11:08,264 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.81443880428652 [2022-01-19 06:11:08,264 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1444 transitions. [2022-01-19 06:11:08,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1444 transitions. [2022-01-19 06:11:08,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:11:08,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1444 transitions. [2022-01-19 06:11:08,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 160.44444444444446) internal successors, (1444), 9 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:08,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 197.0) internal successors, (1970), 10 states have internal predecessors, (1970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:08,269 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 197.0) internal successors, (1970), 10 states have internal predecessors, (1970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:08,269 INFO L186 Difference]: Start difference. First operand has 166 places, 163 transitions, 341 flow. Second operand 9 states and 1444 transitions. [2022-01-19 06:11:08,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 173 transitions, 403 flow [2022-01-19 06:11:08,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 173 transitions, 401 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 06:11:08,272 INFO L242 Difference]: Finished difference. Result has 176 places, 169 transitions, 389 flow [2022-01-19 06:11:08,272 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=389, PETRI_PLACES=176, PETRI_TRANSITIONS=169} [2022-01-19 06:11:08,273 INFO L334 CegarLoopForPetriNet]: 165 programPoint places, 11 predicate places. [2022-01-19 06:11:08,273 INFO L470 AbstractCegarLoop]: Abstraction has has 176 places, 169 transitions, 389 flow [2022-01-19 06:11:08,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 160.1) internal successors, (1601), 10 states have internal predecessors, (1601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:08,274 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:11:08,274 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 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] [2022-01-19 06:11:08,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-19 06:11:08,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:11:08,497 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-19 06:11:08,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:11:08,497 INFO L85 PathProgramCache]: Analyzing trace with hash 81295910, now seen corresponding path program 2 times [2022-01-19 06:11:08,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:11:08,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700503209] [2022-01-19 06:11:08,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:11:08,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:11:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:11:08,553 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 06:11:08,554 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:11:08,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700503209] [2022-01-19 06:11:08,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700503209] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:11:08,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663137610] [2022-01-19 06:11:08,554 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 06:11:08,554 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:11:08,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:11:08,556 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 06:11:08,557 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 06:11:08,632 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 06:11:08,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:11:08,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 06:11:08,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:11:08,766 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 06:11:08,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:11:08,912 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 06:11:08,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663137610] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:11:08,913 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:11:08,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-01-19 06:11:08,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86262615] [2022-01-19 06:11:08,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:11:08,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-19 06:11:08,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:11:08,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-19 06:11:08,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-01-19 06:11:08,916 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 197 [2022-01-19 06:11:08,919 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 169 transitions, 389 flow. Second operand has 18 states, 18 states have (on average 160.27777777777777) internal successors, (2885), 18 states have internal predecessors, (2885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:08,919 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:11:08,919 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 197 [2022-01-19 06:11:08,919 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:11:09,090 INFO L129 PetriNetUnfolder]: 4/251 cut-off events. [2022-01-19 06:11:09,090 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-01-19 06:11:09,091 INFO L84 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 251 events. 4/251 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 633 event pairs, 0 based on Foata normal form. 4/244 useless extension candidates. Maximal degree in co-relation 347. Up to 11 conditions per place. [2022-01-19 06:11:09,092 INFO L132 encePairwiseOnDemand]: 191/197 looper letters, 19 selfloop transitions, 21 changer transitions 0/193 dead transitions. [2022-01-19 06:11:09,092 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 193 transitions, 577 flow [2022-01-19 06:11:09,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-19 06:11:09,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-01-19 06:11:09,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3362 transitions. [2022-01-19 06:11:09,096 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8126661832245589 [2022-01-19 06:11:09,096 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3362 transitions. [2022-01-19 06:11:09,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3362 transitions. [2022-01-19 06:11:09,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:11:09,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3362 transitions. [2022-01-19 06:11:09,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 160.0952380952381) internal successors, (3362), 21 states have internal predecessors, (3362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:09,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 197.0) internal successors, (4334), 22 states have internal predecessors, (4334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:09,108 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 197.0) internal successors, (4334), 22 states have internal predecessors, (4334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:09,108 INFO L186 Difference]: Start difference. First operand has 176 places, 169 transitions, 389 flow. Second operand 21 states and 3362 transitions. [2022-01-19 06:11:09,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 193 transitions, 577 flow [2022-01-19 06:11:09,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 193 transitions, 563 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-01-19 06:11:09,112 INFO L242 Difference]: Finished difference. Result has 200 places, 182 transitions, 513 flow [2022-01-19 06:11:09,112 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=513, PETRI_PLACES=200, PETRI_TRANSITIONS=182} [2022-01-19 06:11:09,113 INFO L334 CegarLoopForPetriNet]: 165 programPoint places, 35 predicate places. [2022-01-19 06:11:09,114 INFO L470 AbstractCegarLoop]: Abstraction has has 200 places, 182 transitions, 513 flow [2022-01-19 06:11:09,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 160.27777777777777) internal successors, (2885), 18 states have internal predecessors, (2885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:09,115 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:11:09,115 INFO L254 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 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] [2022-01-19 06:11:09,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-19 06:11:09,335 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,SelfDestructingSolverStorable12 [2022-01-19 06:11:09,335 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-19 06:11:09,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:11:09,336 INFO L85 PathProgramCache]: Analyzing trace with hash 653252134, now seen corresponding path program 3 times [2022-01-19 06:11:09,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:11:09,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933967720] [2022-01-19 06:11:09,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:11:09,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:11:09,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:11:09,470 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 06:11:09,471 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:11:09,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933967720] [2022-01-19 06:11:09,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933967720] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:11:09,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716994263] [2022-01-19 06:11:09,471 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 06:11:09,471 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:11:09,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:11:09,472 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 06:11:09,474 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 06:11:09,573 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-01-19 06:11:09,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:11:09,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-19 06:11:09,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:11:09,707 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 06:11:09,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:11:09,891 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 06:11:09,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716994263] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:11:09,892 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:11:09,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-01-19 06:11:09,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482816014] [2022-01-19 06:11:09,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:11:09,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-19 06:11:09,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:11:09,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-19 06:11:09,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-01-19 06:11:09,896 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 197 [2022-01-19 06:11:09,898 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 182 transitions, 513 flow. Second operand has 23 states, 23 states have (on average 160.43478260869566) internal successors, (3690), 23 states have internal predecessors, (3690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:09,898 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:11:09,898 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 197 [2022-01-19 06:11:09,898 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:11:10,160 INFO L129 PetriNetUnfolder]: 4/266 cut-off events. [2022-01-19 06:11:10,161 INFO L130 PetriNetUnfolder]: For 110/110 co-relation queries the response was YES. [2022-01-19 06:11:10,162 INFO L84 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 266 events. 4/266 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 633 event pairs, 0 based on Foata normal form. 3/258 useless extension candidates. Maximal degree in co-relation 443. Up to 17 conditions per place. [2022-01-19 06:11:10,163 INFO L132 encePairwiseOnDemand]: 191/197 looper letters, 25 selfloop transitions, 30 changer transitions 0/208 dead transitions. [2022-01-19 06:11:10,163 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 208 transitions, 769 flow [2022-01-19 06:11:10,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-19 06:11:10,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-01-19 06:11:10,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 4798 transitions. [2022-01-19 06:11:10,169 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.811844331641286 [2022-01-19 06:11:10,169 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 4798 transitions. [2022-01-19 06:11:10,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 4798 transitions. [2022-01-19 06:11:10,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:11:10,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 4798 transitions. [2022-01-19 06:11:10,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 159.93333333333334) internal successors, (4798), 30 states have internal predecessors, (4798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:10,183 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 197.0) internal successors, (6107), 31 states have internal predecessors, (6107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:10,184 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 197.0) internal successors, (6107), 31 states have internal predecessors, (6107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:10,184 INFO L186 Difference]: Start difference. First operand has 200 places, 182 transitions, 513 flow. Second operand 30 states and 4798 transitions. [2022-01-19 06:11:10,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 208 transitions, 769 flow [2022-01-19 06:11:10,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 208 transitions, 739 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-01-19 06:11:10,189 INFO L242 Difference]: Finished difference. Result has 227 places, 192 transitions, 641 flow [2022-01-19 06:11:10,190 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=641, PETRI_PLACES=227, PETRI_TRANSITIONS=192} [2022-01-19 06:11:10,190 INFO L334 CegarLoopForPetriNet]: 165 programPoint places, 62 predicate places. [2022-01-19 06:11:10,190 INFO L470 AbstractCegarLoop]: Abstraction has has 227 places, 192 transitions, 641 flow [2022-01-19 06:11:10,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 160.43478260869566) internal successors, (3690), 23 states have internal predecessors, (3690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:10,191 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:11:10,192 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 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] [2022-01-19 06:11:10,218 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 06:11:10,407 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,SelfDestructingSolverStorable13 [2022-01-19 06:11:10,407 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-19 06:11:10,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:11:10,408 INFO L85 PathProgramCache]: Analyzing trace with hash -2059256618, now seen corresponding path program 4 times [2022-01-19 06:11:10,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:11:10,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966032291] [2022-01-19 06:11:10,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:11:10,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:11:10,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 06:11:10,437 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 06:11:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 06:11:10,480 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 06:11:10,480 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 06:11:10,480 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 1 remaining) [2022-01-19 06:11:10,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-19 06:11:10,481 INFO L732 BasicCegarLoop]: Path program histogram: [4, 1, 1] [2022-01-19 06:11:10,481 INFO L309 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2022-01-19 06:11:10,482 WARN L235 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-01-19 06:11:10,482 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-01-19 06:11:10,500 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,500 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,500 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,500 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,500 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,500 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,500 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,500 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,501 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,501 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,501 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,501 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,501 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,501 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,501 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,501 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,501 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,501 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,501 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,501 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,502 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,502 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,502 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,502 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,502 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,502 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,502 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,502 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,502 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,502 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,502 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,502 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,502 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,503 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,503 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,503 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,503 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,503 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,503 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,503 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,503 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,503 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,503 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,503 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,504 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,504 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,504 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,504 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,504 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,504 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,504 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,504 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,504 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,504 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,504 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,505 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,505 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,505 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,505 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,505 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,505 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,505 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,505 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,505 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,505 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,506 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,506 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,506 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,506 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,506 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,506 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,506 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,506 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,506 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,506 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,507 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,507 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,507 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,507 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,507 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,507 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,507 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,507 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,507 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,507 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,507 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,507 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,507 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,508 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,508 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,508 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,508 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,508 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,508 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,508 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,508 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,508 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,508 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,508 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,508 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,509 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,509 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,509 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,509 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,509 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,509 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,509 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,509 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,509 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,510 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,510 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,510 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,510 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,510 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,510 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,510 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,510 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,510 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,510 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,510 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,510 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,512 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,512 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,512 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,512 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,512 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,512 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,513 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,513 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,513 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,513 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,513 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,513 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,513 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,519 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,520 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,521 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,521 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,521 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,521 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,521 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,521 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,521 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,521 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,521 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,521 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,522 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,522 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,522 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,522 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,522 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,522 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,522 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,522 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,522 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,522 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,522 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,522 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,522 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,523 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,523 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,523 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,523 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,523 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,523 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,523 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,523 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,523 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,523 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,523 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,523 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,523 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,523 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,524 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,524 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,524 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,524 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,524 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,524 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,524 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,524 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,524 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,524 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,524 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,524 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,524 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,525 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,525 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,525 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,525 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,525 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,525 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,525 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,525 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,525 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,525 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,525 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,525 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,525 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,526 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,526 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,526 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,526 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,526 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,526 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,526 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,526 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,526 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,526 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,526 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,526 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,526 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,527 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,527 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,527 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,527 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,527 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,527 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,527 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,527 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,527 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,527 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,527 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,527 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,527 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,527 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,528 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,528 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,528 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,528 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,528 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,528 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,528 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,528 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,528 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,528 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,528 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,528 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,528 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,528 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,530 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,530 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,530 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,530 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,530 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,530 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,530 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,530 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,530 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,530 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,530 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,530 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,531 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,531 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,531 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,531 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,531 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,531 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,531 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,531 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,531 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,531 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,531 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,531 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,531 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,531 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,531 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,532 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,532 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,532 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,532 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,532 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,532 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,533 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,533 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,533 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,533 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,533 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,533 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,533 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,533 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,533 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,533 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,533 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,534 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,534 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,534 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,534 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,534 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,534 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,534 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,534 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,534 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,534 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,535 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,535 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,535 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,535 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,535 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,535 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,535 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,535 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,535 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,535 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,535 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,535 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,535 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,535 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,535 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,536 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,536 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,536 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,536 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,536 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,536 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,536 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:11:10,537 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-01-19 06:11:10,538 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 06:11:10,539 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 06:11:10,539 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-19 06:11:10,542 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 229 places, 269 transitions, 556 flow [2022-01-19 06:11:10,579 INFO L129 PetriNetUnfolder]: 75/438 cut-off events. [2022-01-19 06:11:10,580 INFO L130 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2022-01-19 06:11:10,583 INFO L84 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 438 events. 75/438 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1740 event pairs, 0 based on Foata normal form. 0/354 useless extension candidates. Maximal degree in co-relation 271. Up to 12 conditions per place. [2022-01-19 06:11:10,583 INFO L82 GeneralOperation]: Start removeDead. Operand has 229 places, 269 transitions, 556 flow [2022-01-19 06:11:10,586 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 229 places, 269 transitions, 556 flow [2022-01-19 06:11:10,593 INFO L129 PetriNetUnfolder]: 15/139 cut-off events. [2022-01-19 06:11:10,594 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 06:11:10,594 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:11:10,594 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] [2022-01-19 06:11:10,594 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:11:10,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:11:10,594 INFO L85 PathProgramCache]: Analyzing trace with hash -280318449, now seen corresponding path program 1 times [2022-01-19 06:11:10,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:11:10,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315047096] [2022-01-19 06:11:10,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:11:10,595 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:11:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:11:10,607 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 06:11:10,607 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:11:10,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315047096] [2022-01-19 06:11:10,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315047096] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:11:10,607 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:11:10,607 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 06:11:10,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154054819] [2022-01-19 06:11:10,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:11:10,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 06:11:10,608 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:11:10,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 06:11:10,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 06:11:10,609 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 269 [2022-01-19 06:11:10,609 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 269 transitions, 556 flow. Second operand has 2 states, 2 states have (on average 224.0) internal successors, (448), 2 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:10,609 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:11:10,609 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 269 [2022-01-19 06:11:10,610 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:11:10,652 INFO L129 PetriNetUnfolder]: 9/367 cut-off events. [2022-01-19 06:11:10,652 INFO L130 PetriNetUnfolder]: For 18/22 co-relation queries the response was YES. [2022-01-19 06:11:10,655 INFO L84 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 367 events. 9/367 cut-off events. For 18/22 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1433 event pairs, 0 based on Foata normal form. 91/437 useless extension candidates. Maximal degree in co-relation 230. Up to 7 conditions per place. [2022-01-19 06:11:10,656 INFO L132 encePairwiseOnDemand]: 230/269 looper letters, 4 selfloop transitions, 0 changer transitions 1/227 dead transitions. [2022-01-19 06:11:10,656 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 227 transitions, 480 flow [2022-01-19 06:11:10,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 06:11:10,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 06:11:10,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 489 transitions. [2022-01-19 06:11:10,658 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9089219330855018 [2022-01-19 06:11:10,658 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 489 transitions. [2022-01-19 06:11:10,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 489 transitions. [2022-01-19 06:11:10,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:11:10,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 489 transitions. [2022-01-19 06:11:10,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 244.5) internal successors, (489), 2 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:10,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:10,660 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:10,660 INFO L186 Difference]: Start difference. First operand has 229 places, 269 transitions, 556 flow. Second operand 2 states and 489 transitions. [2022-01-19 06:11:10,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 227 transitions, 480 flow [2022-01-19 06:11:10,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 227 transitions, 480 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 06:11:10,664 INFO L242 Difference]: Finished difference. Result has 227 places, 226 transitions, 470 flow [2022-01-19 06:11:10,664 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=470, PETRI_PLACES=227, PETRI_TRANSITIONS=226} [2022-01-19 06:11:10,664 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, -2 predicate places. [2022-01-19 06:11:10,665 INFO L470 AbstractCegarLoop]: Abstraction has has 227 places, 226 transitions, 470 flow [2022-01-19 06:11:10,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 224.0) internal successors, (448), 2 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:10,665 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:11:10,665 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] [2022-01-19 06:11:10,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-19 06:11:10,666 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:11:10,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:11:10,666 INFO L85 PathProgramCache]: Analyzing trace with hash -2106119919, now seen corresponding path program 1 times [2022-01-19 06:11:10,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:11:10,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923121428] [2022-01-19 06:11:10,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:11:10,667 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:11:10,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:11:10,685 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 06:11:10,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:11:10,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923121428] [2022-01-19 06:11:10,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923121428] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:11:10,686 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:11:10,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 06:11:10,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790285204] [2022-01-19 06:11:10,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:11:10,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 06:11:10,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:11:10,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 06:11:10,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 06:11:10,688 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 269 [2022-01-19 06:11:10,688 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 226 transitions, 470 flow. Second operand has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:10,688 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:11:10,688 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 269 [2022-01-19 06:11:10,689 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:11:10,755 INFO L129 PetriNetUnfolder]: 9/370 cut-off events. [2022-01-19 06:11:10,755 INFO L130 PetriNetUnfolder]: For 18/22 co-relation queries the response was YES. [2022-01-19 06:11:10,758 INFO L84 FinitePrefix]: Finished finitePrefix Result has 403 conditions, 370 events. 9/370 cut-off events. For 18/22 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1429 event pairs, 0 based on Foata normal form. 0/350 useless extension candidates. Maximal degree in co-relation 398. Up to 14 conditions per place. [2022-01-19 06:11:10,759 INFO L132 encePairwiseOnDemand]: 266/269 looper letters, 13 selfloop transitions, 2 changer transitions 0/230 dead transitions. [2022-01-19 06:11:10,759 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 230 transitions, 508 flow [2022-01-19 06:11:10,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 06:11:10,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 06:11:10,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 664 transitions. [2022-01-19 06:11:10,760 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8228004956629492 [2022-01-19 06:11:10,760 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 664 transitions. [2022-01-19 06:11:10,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 664 transitions. [2022-01-19 06:11:10,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:11:10,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 664 transitions. [2022-01-19 06:11:10,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 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 06:11:10,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:10,763 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:10,763 INFO L186 Difference]: Start difference. First operand has 227 places, 226 transitions, 470 flow. Second operand 3 states and 664 transitions. [2022-01-19 06:11:10,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 230 transitions, 508 flow [2022-01-19 06:11:10,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 230 transitions, 508 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 06:11:10,766 INFO L242 Difference]: Finished difference. Result has 229 places, 227 transitions, 482 flow [2022-01-19 06:11:10,767 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=482, PETRI_PLACES=229, PETRI_TRANSITIONS=227} [2022-01-19 06:11:10,767 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 0 predicate places. [2022-01-19 06:11:10,767 INFO L470 AbstractCegarLoop]: Abstraction has has 229 places, 227 transitions, 482 flow [2022-01-19 06:11:10,767 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:10,767 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:11:10,768 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] [2022-01-19 06:11:10,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-19 06:11:10,768 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:11:10,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:11:10,768 INFO L85 PathProgramCache]: Analyzing trace with hash 178238190, now seen corresponding path program 1 times [2022-01-19 06:11:10,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:11:10,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613832971] [2022-01-19 06:11:10,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:11:10,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:11:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:11:10,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:11:10,792 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:11:10,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613832971] [2022-01-19 06:11:10,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613832971] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:11:10,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485359627] [2022-01-19 06:11:10,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:11:10,793 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:11:10,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:11:10,794 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 06:11:10,804 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 06:11:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:11:10,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-19 06:11:10,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:11:10,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:11:10,959 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 06:11:10,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485359627] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:11:10,960 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 06:11:10,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-01-19 06:11:10,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238576592] [2022-01-19 06:11:10,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:11:10,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 06:11:10,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:11:10,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 06:11:10,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-19 06:11:10,962 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 269 [2022-01-19 06:11:10,962 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 227 transitions, 482 flow. Second operand has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:10,962 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:11:10,963 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 269 [2022-01-19 06:11:10,963 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:11:11,007 INFO L129 PetriNetUnfolder]: 7/325 cut-off events. [2022-01-19 06:11:11,008 INFO L130 PetriNetUnfolder]: For 15/34 co-relation queries the response was YES. [2022-01-19 06:11:11,011 INFO L84 FinitePrefix]: Finished finitePrefix Result has 368 conditions, 325 events. 7/325 cut-off events. For 15/34 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1107 event pairs, 0 based on Foata normal form. 1/310 useless extension candidates. Maximal degree in co-relation 361. Up to 16 conditions per place. [2022-01-19 06:11:11,012 INFO L132 encePairwiseOnDemand]: 266/269 looper letters, 13 selfloop transitions, 2 changer transitions 0/231 dead transitions. [2022-01-19 06:11:11,012 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 231 transitions, 520 flow [2022-01-19 06:11:11,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 06:11:11,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 06:11:11,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 664 transitions. [2022-01-19 06:11:11,013 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8228004956629492 [2022-01-19 06:11:11,013 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 664 transitions. [2022-01-19 06:11:11,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 664 transitions. [2022-01-19 06:11:11,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:11:11,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 664 transitions. [2022-01-19 06:11:11,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 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 06:11:11,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:11,016 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:11,016 INFO L186 Difference]: Start difference. First operand has 229 places, 227 transitions, 482 flow. Second operand 3 states and 664 transitions. [2022-01-19 06:11:11,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 231 transitions, 520 flow [2022-01-19 06:11:11,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 231 transitions, 518 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 06:11:11,020 INFO L242 Difference]: Finished difference. Result has 231 places, 228 transitions, 492 flow [2022-01-19 06:11:11,021 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=492, PETRI_PLACES=231, PETRI_TRANSITIONS=228} [2022-01-19 06:11:11,021 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 2 predicate places. [2022-01-19 06:11:11,021 INFO L470 AbstractCegarLoop]: Abstraction has has 231 places, 228 transitions, 492 flow [2022-01-19 06:11:11,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:11,021 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:11:11,022 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] [2022-01-19 06:11:11,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-19 06:11:11,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-01-19 06:11:11,247 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:11:11,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:11:11,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1349753429, now seen corresponding path program 1 times [2022-01-19 06:11:11,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:11:11,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677435836] [2022-01-19 06:11:11,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:11:11,248 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:11:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:11:11,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:11:11,277 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:11:11,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677435836] [2022-01-19 06:11:11,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677435836] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:11:11,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468522659] [2022-01-19 06:11:11,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:11:11,278 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:11:11,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:11:11,279 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 06:11:11,280 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 06:11:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:11:11,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-19 06:11:11,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:11:11,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:11:11,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:11:11,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:11:11,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468522659] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:11:11,577 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:11:11,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-19 06:11:11,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573326524] [2022-01-19 06:11:11,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:11:11,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 06:11:11,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:11:11,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 06:11:11,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-01-19 06:11:11,581 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 269 [2022-01-19 06:11:11,583 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 228 transitions, 492 flow. Second operand has 10 states, 10 states have (on average 217.1) internal successors, (2171), 10 states have internal predecessors, (2171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:11,583 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:11:11,583 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 269 [2022-01-19 06:11:11,583 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:11:11,675 INFO L129 PetriNetUnfolder]: 7/332 cut-off events. [2022-01-19 06:11:11,675 INFO L130 PetriNetUnfolder]: For 19/23 co-relation queries the response was YES. [2022-01-19 06:11:11,678 INFO L84 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 332 events. 7/332 cut-off events. For 19/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1102 event pairs, 0 based on Foata normal form. 2/320 useless extension candidates. Maximal degree in co-relation 379. Up to 11 conditions per place. [2022-01-19 06:11:11,679 INFO L132 encePairwiseOnDemand]: 263/269 looper letters, 14 selfloop transitions, 9 changer transitions 0/238 dead transitions. [2022-01-19 06:11:11,679 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 238 transitions, 560 flow [2022-01-19 06:11:11,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 06:11:11,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 06:11:11,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1960 transitions. [2022-01-19 06:11:11,682 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8095828170177612 [2022-01-19 06:11:11,682 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1960 transitions. [2022-01-19 06:11:11,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1960 transitions. [2022-01-19 06:11:11,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:11:11,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1960 transitions. [2022-01-19 06:11:11,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 217.77777777777777) internal successors, (1960), 9 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:11,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 269.0) internal successors, (2690), 10 states have internal predecessors, (2690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:11,689 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 269.0) internal successors, (2690), 10 states have internal predecessors, (2690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:11,689 INFO L186 Difference]: Start difference. First operand has 231 places, 228 transitions, 492 flow. Second operand 9 states and 1960 transitions. [2022-01-19 06:11:11,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 238 transitions, 560 flow [2022-01-19 06:11:11,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 238 transitions, 558 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 06:11:11,693 INFO L242 Difference]: Finished difference. Result has 241 places, 234 transitions, 540 flow [2022-01-19 06:11:11,693 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=540, PETRI_PLACES=241, PETRI_TRANSITIONS=234} [2022-01-19 06:11:11,694 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 12 predicate places. [2022-01-19 06:11:11,694 INFO L470 AbstractCegarLoop]: Abstraction has has 241 places, 234 transitions, 540 flow [2022-01-19 06:11:11,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 217.1) internal successors, (2171), 10 states have internal predecessors, (2171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:11,695 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:11:11,695 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:11:11,719 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 06:11:11,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:11:11,908 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:11:11,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:11:11,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1017331595, now seen corresponding path program 2 times [2022-01-19 06:11:11,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:11:11,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294109428] [2022-01-19 06:11:11,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:11:11,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:11:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:11:11,946 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-19 06:11:11,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:11:11,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294109428] [2022-01-19 06:11:11,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294109428] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:11:11,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355892880] [2022-01-19 06:11:11,947 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 06:11:11,947 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:11:11,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:11:11,948 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 06:11:11,949 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 06:11:12,038 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 06:11:12,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:11:12,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 06:11:12,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:11:12,165 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:11:12,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:11:12,312 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:11:12,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355892880] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:11:12,313 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:11:12,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2022-01-19 06:11:12,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33019968] [2022-01-19 06:11:12,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:11:12,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 06:11:12,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:11:12,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 06:11:12,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-01-19 06:11:12,317 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 269 [2022-01-19 06:11:12,321 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 234 transitions, 540 flow. Second operand has 19 states, 19 states have (on average 211.05263157894737) internal successors, (4010), 19 states have internal predecessors, (4010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:12,321 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:11:12,321 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 269 [2022-01-19 06:11:12,321 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:11:12,554 INFO L129 PetriNetUnfolder]: 5/307 cut-off events. [2022-01-19 06:11:12,555 INFO L130 PetriNetUnfolder]: For 36/43 co-relation queries the response was YES. [2022-01-19 06:11:12,558 INFO L84 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 307 events. 5/307 cut-off events. For 36/43 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 722 event pairs, 1 based on Foata normal form. 6/301 useless extension candidates. Maximal degree in co-relation 434. Up to 14 conditions per place. [2022-01-19 06:11:12,559 INFO L132 encePairwiseOnDemand]: 258/269 looper letters, 31 selfloop transitions, 26 changer transitions 0/264 dead transitions. [2022-01-19 06:11:12,559 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 264 transitions, 774 flow [2022-01-19 06:11:12,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-19 06:11:12,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-01-19 06:11:12,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 5262 transitions. [2022-01-19 06:11:12,566 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.782453531598513 [2022-01-19 06:11:12,566 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 5262 transitions. [2022-01-19 06:11:12,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 5262 transitions. [2022-01-19 06:11:12,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:11:12,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 5262 transitions. [2022-01-19 06:11:12,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 210.48) internal successors, (5262), 25 states have internal predecessors, (5262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:12,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 269.0) internal successors, (6994), 26 states have internal predecessors, (6994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:12,585 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 269.0) internal successors, (6994), 26 states have internal predecessors, (6994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:12,585 INFO L186 Difference]: Start difference. First operand has 241 places, 234 transitions, 540 flow. Second operand 25 states and 5262 transitions. [2022-01-19 06:11:12,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 264 transitions, 774 flow [2022-01-19 06:11:12,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 264 transitions, 760 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-01-19 06:11:12,591 INFO L242 Difference]: Finished difference. Result has 272 places, 249 transitions, 692 flow [2022-01-19 06:11:12,591 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=692, PETRI_PLACES=272, PETRI_TRANSITIONS=249} [2022-01-19 06:11:12,591 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 43 predicate places. [2022-01-19 06:11:12,592 INFO L470 AbstractCegarLoop]: Abstraction has has 272 places, 249 transitions, 692 flow [2022-01-19 06:11:12,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 211.05263157894737) internal successors, (4010), 19 states have internal predecessors, (4010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:12,593 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:11:12,593 INFO L254 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:11:12,620 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 06:11:12,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:11:12,808 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:11:12,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:11:12,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1468889109, now seen corresponding path program 1 times [2022-01-19 06:11:12,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:11:12,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177604196] [2022-01-19 06:11:12,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:11:12,809 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:11:12,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:11:12,946 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:11:12,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:11:12,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177604196] [2022-01-19 06:11:12,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177604196] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:11:12,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534171434] [2022-01-19 06:11:12,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:11:12,946 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:11:12,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:11:12,948 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 06:11:12,949 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 06:11:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:11:13,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-19 06:11:13,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:11:13,209 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:11:13,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:11:13,430 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:11:13,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534171434] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:11:13,430 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:11:13,430 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-01-19 06:11:13,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741463801] [2022-01-19 06:11:13,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:11:13,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-19 06:11:13,431 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:11:13,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-19 06:11:13,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-01-19 06:11:13,436 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 269 [2022-01-19 06:11:13,440 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 249 transitions, 692 flow. Second operand has 23 states, 23 states have (on average 217.43478260869566) internal successors, (5001), 23 states have internal predecessors, (5001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:13,440 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:11:13,440 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 269 [2022-01-19 06:11:13,440 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:11:13,705 INFO L129 PetriNetUnfolder]: 5/322 cut-off events. [2022-01-19 06:11:13,706 INFO L130 PetriNetUnfolder]: For 135/136 co-relation queries the response was YES. [2022-01-19 06:11:13,709 INFO L84 FinitePrefix]: Finished finitePrefix Result has 546 conditions, 322 events. 5/322 cut-off events. For 135/136 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 722 event pairs, 1 based on Foata normal form. 3/313 useless extension candidates. Maximal degree in co-relation 528. Up to 17 conditions per place. [2022-01-19 06:11:13,710 INFO L132 encePairwiseOnDemand]: 263/269 looper letters, 28 selfloop transitions, 30 changer transitions 0/275 dead transitions. [2022-01-19 06:11:13,710 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 275 transitions, 954 flow [2022-01-19 06:11:13,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-19 06:11:13,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-01-19 06:11:13,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 6511 transitions. [2022-01-19 06:11:13,717 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8068153655514251 [2022-01-19 06:11:13,717 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 6511 transitions. [2022-01-19 06:11:13,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 6511 transitions. [2022-01-19 06:11:13,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:11:13,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 6511 transitions. [2022-01-19 06:11:13,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 217.03333333333333) internal successors, (6511), 30 states have internal predecessors, (6511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:13,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 269.0) internal successors, (8339), 31 states have internal predecessors, (8339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:13,739 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 269.0) internal successors, (8339), 31 states have internal predecessors, (8339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:13,739 INFO L186 Difference]: Start difference. First operand has 272 places, 249 transitions, 692 flow. Second operand 30 states and 6511 transitions. [2022-01-19 06:11:13,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 275 transitions, 954 flow [2022-01-19 06:11:13,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 275 transitions, 920 flow, removed 10 selfloop flow, removed 7 redundant places. [2022-01-19 06:11:13,745 INFO L242 Difference]: Finished difference. Result has 298 places, 259 transitions, 816 flow [2022-01-19 06:11:13,745 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=816, PETRI_PLACES=298, PETRI_TRANSITIONS=259} [2022-01-19 06:11:13,745 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 69 predicate places. [2022-01-19 06:11:13,745 INFO L470 AbstractCegarLoop]: Abstraction has has 298 places, 259 transitions, 816 flow [2022-01-19 06:11:13,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 217.43478260869566) internal successors, (5001), 23 states have internal predecessors, (5001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:13,747 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:11:13,747 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:11:13,773 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 06:11:13,971 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,SelfDestructingSolverStorable20 [2022-01-19 06:11:13,971 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:11:13,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:11:13,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1471219096, now seen corresponding path program 2 times [2022-01-19 06:11:13,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:11:13,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571089938] [2022-01-19 06:11:13,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:11:13,972 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:11:13,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:11:14,689 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:11:14,689 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:11:14,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571089938] [2022-01-19 06:11:14,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571089938] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:11:14,689 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:11:14,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-19 06:11:14,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954491392] [2022-01-19 06:11:14,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:11:14,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-19 06:11:14,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:11:14,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-19 06:11:14,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2022-01-19 06:11:14,692 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 269 [2022-01-19 06:11:14,694 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 259 transitions, 816 flow. Second operand has 18 states, 18 states have (on average 146.94444444444446) internal successors, (2645), 18 states have internal predecessors, (2645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:14,694 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:11:14,695 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 269 [2022-01-19 06:11:14,695 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:11:24,807 INFO L129 PetriNetUnfolder]: 24957/62906 cut-off events. [2022-01-19 06:11:24,807 INFO L130 PetriNetUnfolder]: For 4616/4636 co-relation queries the response was YES. [2022-01-19 06:11:25,155 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105540 conditions, 62906 events. 24957/62906 cut-off events. For 4616/4636 co-relation queries the response was YES. Maximal size of possible extension queue 1956. Compared 801612 event pairs, 5523 based on Foata normal form. 20/60681 useless extension candidates. Maximal degree in co-relation 105518. Up to 15469 conditions per place. [2022-01-19 06:11:25,345 INFO L132 encePairwiseOnDemand]: 249/269 looper letters, 601 selfloop transitions, 94 changer transitions 152/1022 dead transitions. [2022-01-19 06:11:25,345 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 1022 transitions, 4356 flow [2022-01-19 06:11:25,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-01-19 06:11:25,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2022-01-19 06:11:25,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 7087 transitions. [2022-01-19 06:11:25,355 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6126912769084465 [2022-01-19 06:11:25,355 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 7087 transitions. [2022-01-19 06:11:25,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 7087 transitions. [2022-01-19 06:11:25,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:11:25,358 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 7087 transitions. [2022-01-19 06:11:25,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 164.8139534883721) internal successors, (7087), 43 states have internal predecessors, (7087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:25,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 269.0) internal successors, (11836), 44 states have internal predecessors, (11836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:25,388 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 269.0) internal successors, (11836), 44 states have internal predecessors, (11836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:25,388 INFO L186 Difference]: Start difference. First operand has 298 places, 259 transitions, 816 flow. Second operand 43 states and 7087 transitions. [2022-01-19 06:11:25,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 1022 transitions, 4356 flow [2022-01-19 06:11:25,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 1022 transitions, 4312 flow, removed 4 selfloop flow, removed 18 redundant places. [2022-01-19 06:11:25,439 INFO L242 Difference]: Finished difference. Result has 343 places, 365 transitions, 1428 flow [2022-01-19 06:11:25,439 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=1428, PETRI_PLACES=343, PETRI_TRANSITIONS=365} [2022-01-19 06:11:25,440 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 114 predicate places. [2022-01-19 06:11:25,440 INFO L470 AbstractCegarLoop]: Abstraction has has 343 places, 365 transitions, 1428 flow [2022-01-19 06:11:25,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 146.94444444444446) internal successors, (2645), 18 states have internal predecessors, (2645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:25,441 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:11:25,441 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 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] [2022-01-19 06:11:25,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-19 06:11:25,442 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:11:25,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:11:25,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1138726636, now seen corresponding path program 1 times [2022-01-19 06:11:25,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:11:25,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691974703] [2022-01-19 06:11:25,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:11:25,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:11:25,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:11:25,500 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:11:25,500 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:11:25,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691974703] [2022-01-19 06:11:25,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691974703] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:11:25,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632727825] [2022-01-19 06:11:25,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:11:25,501 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:11:25,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:11:25,502 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 06:11:25,503 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 06:11:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:11:25,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-19 06:11:25,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:11:25,788 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:11:25,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:11:25,952 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:11:25,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632727825] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:11:25,953 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:11:25,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-01-19 06:11:25,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214447341] [2022-01-19 06:11:25,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:11:25,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-19 06:11:25,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:11:25,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-19 06:11:25,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-01-19 06:11:25,956 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 269 [2022-01-19 06:11:25,959 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 365 transitions, 1428 flow. Second operand has 14 states, 14 states have (on average 217.5) internal successors, (3045), 14 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 06:11:25,959 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:11:25,959 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 269 [2022-01-19 06:11:25,959 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:11:26,143 INFO L129 PetriNetUnfolder]: 55/858 cut-off events. [2022-01-19 06:11:26,144 INFO L130 PetriNetUnfolder]: For 915/991 co-relation queries the response was YES. [2022-01-19 06:11:26,150 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1471 conditions, 858 events. 55/858 cut-off events. For 915/991 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 5106 event pairs, 9 based on Foata normal form. 55/889 useless extension candidates. Maximal degree in co-relation 1427. Up to 31 conditions per place. [2022-01-19 06:11:26,152 INFO L132 encePairwiseOnDemand]: 264/269 looper letters, 19 selfloop transitions, 13 changer transitions 8/254 dead transitions. [2022-01-19 06:11:26,152 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 254 transitions, 1105 flow [2022-01-19 06:11:26,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 06:11:26,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 06:11:26,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1952 transitions. [2022-01-19 06:11:26,155 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8062783973564642 [2022-01-19 06:11:26,155 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1952 transitions. [2022-01-19 06:11:26,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1952 transitions. [2022-01-19 06:11:26,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:11:26,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1952 transitions. [2022-01-19 06:11:26,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 216.88888888888889) internal successors, (1952), 9 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:26,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 269.0) internal successors, (2690), 10 states have internal predecessors, (2690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:26,299 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 269.0) internal successors, (2690), 10 states have internal predecessors, (2690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:26,299 INFO L186 Difference]: Start difference. First operand has 343 places, 365 transitions, 1428 flow. Second operand 9 states and 1952 transitions. [2022-01-19 06:11:26,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 254 transitions, 1105 flow [2022-01-19 06:11:26,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 254 transitions, 1058 flow, removed 7 selfloop flow, removed 16 redundant places. [2022-01-19 06:11:26,307 INFO L242 Difference]: Finished difference. Result has 263 places, 237 transitions, 926 flow [2022-01-19 06:11:26,308 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=939, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=926, PETRI_PLACES=263, PETRI_TRANSITIONS=237} [2022-01-19 06:11:26,308 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 34 predicate places. [2022-01-19 06:11:26,308 INFO L470 AbstractCegarLoop]: Abstraction has has 263 places, 237 transitions, 926 flow [2022-01-19 06:11:26,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 217.5) internal successors, (3045), 14 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 06:11:26,309 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:11:26,309 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 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] [2022-01-19 06:11:26,334 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 06:11:26,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:11:26,510 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:11:26,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:11:26,510 INFO L85 PathProgramCache]: Analyzing trace with hash -747602954, now seen corresponding path program 1 times [2022-01-19 06:11:26,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:11:26,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361664734] [2022-01-19 06:11:26,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:11:26,510 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:11:26,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:11:26,703 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:11:26,703 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:11:26,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361664734] [2022-01-19 06:11:26,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361664734] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:11:26,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755552806] [2022-01-19 06:11:26,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:11:26,703 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:11:26,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:11:26,706 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 06:11:26,707 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 06:11:26,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:11:26,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-19 06:11:26,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:11:26,851 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-01-19 06:11:27,267 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:11:27,267 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:11:27,307 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:11:27,468 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:11:27,486 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-01-19 06:11:27,518 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:11:27,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:11:27,562 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_702 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_702) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2022-01-19 06:11:27,590 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_702 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_702) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2022-01-19 06:11:28,135 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-01-19 06:11:28,156 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:11:28,156 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-19 06:11:28,171 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 4 not checked. [2022-01-19 06:11:28,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755552806] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:11:28,171 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:11:28,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 26 [2022-01-19 06:11:28,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532826915] [2022-01-19 06:11:28,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:11:28,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-19 06:11:28,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:11:28,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-19 06:11:28,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=469, Unknown=2, NotChecked=90, Total=650 [2022-01-19 06:11:28,175 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 269 [2022-01-19 06:11:28,177 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 237 transitions, 926 flow. Second operand has 26 states, 26 states have (on average 158.5) internal successors, (4121), 26 states have internal predecessors, (4121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:11:28,177 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:11:28,178 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 269 [2022-01-19 06:11:28,178 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:11:48,260 WARN L228 SmtUtils]: Spent 20.02s on a formula simplification. DAG size of input: 26 DAG size of output: 21 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:12:10,316 WARN L228 SmtUtils]: Spent 22.03s on a formula simplification. DAG size of input: 30 DAG size of output: 19 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:12:26,343 WARN L228 SmtUtils]: Spent 16.02s on a formula simplification. DAG size of input: 26 DAG size of output: 17 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:12:27,495 INFO L129 PetriNetUnfolder]: 2214/7412 cut-off events. [2022-01-19 06:12:27,495 INFO L130 PetriNetUnfolder]: For 10510/10525 co-relation queries the response was YES. [2022-01-19 06:12:27,533 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16642 conditions, 7412 events. 2214/7412 cut-off events. For 10510/10525 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 78770 event pairs, 194 based on Foata normal form. 25/7228 useless extension candidates. Maximal degree in co-relation 16610. Up to 2715 conditions per place. [2022-01-19 06:12:27,551 INFO L132 encePairwiseOnDemand]: 245/269 looper letters, 141 selfloop transitions, 144 changer transitions 41/478 dead transitions. [2022-01-19 06:12:27,551 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 478 transitions, 2548 flow [2022-01-19 06:12:27,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-19 06:12:27,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-01-19 06:12:27,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4005 transitions. [2022-01-19 06:12:27,557 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6203531598513011 [2022-01-19 06:12:27,557 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4005 transitions. [2022-01-19 06:12:27,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4005 transitions. [2022-01-19 06:12:27,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:12:27,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4005 transitions. [2022-01-19 06:12:27,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 166.875) internal successors, (4005), 24 states have internal predecessors, (4005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:27,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 269.0) internal successors, (6725), 25 states have internal predecessors, (6725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:27,569 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 269.0) internal successors, (6725), 25 states have internal predecessors, (6725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:27,569 INFO L186 Difference]: Start difference. First operand has 263 places, 237 transitions, 926 flow. Second operand 24 states and 4005 transitions. [2022-01-19 06:12:27,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 478 transitions, 2548 flow [2022-01-19 06:12:27,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 478 transitions, 2493 flow, removed 2 selfloop flow, removed 9 redundant places. [2022-01-19 06:12:27,601 INFO L242 Difference]: Finished difference. Result has 288 places, 375 transitions, 2068 flow [2022-01-19 06:12:27,601 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=871, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2068, PETRI_PLACES=288, PETRI_TRANSITIONS=375} [2022-01-19 06:12:27,602 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 59 predicate places. [2022-01-19 06:12:27,602 INFO L470 AbstractCegarLoop]: Abstraction has has 288 places, 375 transitions, 2068 flow [2022-01-19 06:12:27,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 158.5) internal successors, (4121), 26 states have internal predecessors, (4121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:27,603 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:12:27,603 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 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] [2022-01-19 06:12:27,626 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 06:12:27,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:12:27,819 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:12:27,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:12:27,820 INFO L85 PathProgramCache]: Analyzing trace with hash 988648064, now seen corresponding path program 2 times [2022-01-19 06:12:27,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:12:27,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123795178] [2022-01-19 06:12:27,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:12:27,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:12:27,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:12:28,054 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:12:28,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:12:28,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123795178] [2022-01-19 06:12:28,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123795178] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:12:28,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503284530] [2022-01-19 06:12:28,054 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 06:12:28,055 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:12:28,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:12:28,056 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 06:12:28,057 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 06:12:28,180 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 06:12:28,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:12:28,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-19 06:12:28,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:12:28,226 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-01-19 06:12:28,603 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:12:28,603 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:12:28,641 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:12:28,815 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:12:28,862 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-01-19 06:12:28,900 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:12:28,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:12:28,953 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_767 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_767) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2022-01-19 06:12:28,968 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_767 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_767) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|))) is different from false [2022-01-19 06:12:29,530 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-01-19 06:12:29,552 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:12:29,552 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-19 06:12:29,567 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 4 not checked. [2022-01-19 06:12:29,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503284530] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:12:29,567 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:12:29,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 26 [2022-01-19 06:12:29,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001910751] [2022-01-19 06:12:29,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:12:29,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-19 06:12:29,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:12:29,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-19 06:12:29,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=469, Unknown=2, NotChecked=90, Total=650 [2022-01-19 06:12:29,570 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 269 [2022-01-19 06:12:29,572 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 375 transitions, 2068 flow. Second operand has 26 states, 26 states have (on average 158.5) internal successors, (4121), 26 states have internal predecessors, (4121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:12:29,572 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:12:29,572 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 269 [2022-01-19 06:12:29,572 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:12:47,667 WARN L228 SmtUtils]: Spent 18.02s on a formula simplification. DAG size of input: 26 DAG size of output: 21 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:13:13,729 WARN L228 SmtUtils]: Spent 26.02s on a formula simplification. DAG size of input: 30 DAG size of output: 19 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:13:29,761 WARN L228 SmtUtils]: Spent 16.02s on a formula simplification. DAG size of input: 26 DAG size of output: 17 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:13:31,055 INFO L129 PetriNetUnfolder]: 2041/7808 cut-off events. [2022-01-19 06:13:31,055 INFO L130 PetriNetUnfolder]: For 18792/19154 co-relation queries the response was YES. [2022-01-19 06:13:31,107 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20996 conditions, 7808 events. 2041/7808 cut-off events. For 18792/19154 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 86927 event pairs, 181 based on Foata normal form. 107/7594 useless extension candidates. Maximal degree in co-relation 20956. Up to 3062 conditions per place. [2022-01-19 06:13:31,140 INFO L132 encePairwiseOnDemand]: 245/269 looper letters, 193 selfloop transitions, 179 changer transitions 8/532 dead transitions. [2022-01-19 06:13:31,141 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 532 transitions, 3871 flow [2022-01-19 06:13:31,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-19 06:13:31,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-01-19 06:13:31,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3148 transitions. [2022-01-19 06:13:31,145 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6159264331833301 [2022-01-19 06:13:31,146 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3148 transitions. [2022-01-19 06:13:31,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3148 transitions. [2022-01-19 06:13:31,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:13:31,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3148 transitions. [2022-01-19 06:13:31,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 165.68421052631578) internal successors, (3148), 19 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:13:31,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 269.0) internal successors, (5380), 20 states have internal predecessors, (5380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:13:31,156 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 269.0) internal successors, (5380), 20 states have internal predecessors, (5380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:13:31,156 INFO L186 Difference]: Start difference. First operand has 288 places, 375 transitions, 2068 flow. Second operand 19 states and 3148 transitions. [2022-01-19 06:13:31,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 532 transitions, 3871 flow [2022-01-19 06:13:31,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 532 transitions, 3638 flow, removed 112 selfloop flow, removed 5 redundant places. [2022-01-19 06:13:31,416 INFO L242 Difference]: Finished difference. Result has 305 places, 507 transitions, 3600 flow [2022-01-19 06:13:31,417 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=1889, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3600, PETRI_PLACES=305, PETRI_TRANSITIONS=507} [2022-01-19 06:13:31,417 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 76 predicate places. [2022-01-19 06:13:31,417 INFO L470 AbstractCegarLoop]: Abstraction has has 305 places, 507 transitions, 3600 flow [2022-01-19 06:13:31,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 158.5) internal successors, (4121), 26 states have internal predecessors, (4121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:13:31,418 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:13:31,418 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 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 06:13:31,443 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 06:13:31,631 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,SelfDestructingSolverStorable24 [2022-01-19 06:13:31,631 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:13:31,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:13:31,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1670254704, now seen corresponding path program 1 times [2022-01-19 06:13:31,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:13:31,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021129863] [2022-01-19 06:13:31,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:13:31,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:13:31,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:13:31,865 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-01-19 06:13:31,865 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:13:31,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021129863] [2022-01-19 06:13:31,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021129863] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:13:31,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632335613] [2022-01-19 06:13:31,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:13:31,865 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:13:31,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:13:31,867 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 06:13:31,869 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 06:13:32,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:13:32,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-19 06:13:32,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:13:32,052 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-01-19 06:13:32,483 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:13:32,484 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:13:32,531 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:13:32,684 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:13:32,720 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-01-19 06:13:32,750 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-01-19 06:13:32,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:13:32,808 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_832 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_832) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2022-01-19 06:13:32,815 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_832 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_832) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2022-01-19 06:13:33,402 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-01-19 06:13:33,428 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:13:33,428 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-19 06:13:33,445 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 2 not checked. [2022-01-19 06:13:33,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632335613] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:13:33,445 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:13:33,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 26 [2022-01-19 06:13:33,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562031941] [2022-01-19 06:13:33,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:13:33,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-19 06:13:33,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:13:33,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-19 06:13:33,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=469, Unknown=2, NotChecked=90, Total=650 [2022-01-19 06:13:33,449 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 269 [2022-01-19 06:13:33,452 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 507 transitions, 3600 flow. Second operand has 26 states, 26 states have (on average 158.57692307692307) internal successors, (4123), 26 states have internal predecessors, (4123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:13:33,452 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:13:33,452 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 269 [2022-01-19 06:13:33,453 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:13:57,539 WARN L228 SmtUtils]: Spent 24.02s on a formula simplification. DAG size of input: 26 DAG size of output: 21 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:13:59,455 INFO L129 PetriNetUnfolder]: 2282/8779 cut-off events. [2022-01-19 06:13:59,455 INFO L130 PetriNetUnfolder]: For 24633/25099 co-relation queries the response was YES. [2022-01-19 06:13:59,493 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25591 conditions, 8779 events. 2282/8779 cut-off events. For 24633/25099 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 99641 event pairs, 259 based on Foata normal form. 134/8610 useless extension candidates. Maximal degree in co-relation 25544. Up to 1844 conditions per place. [2022-01-19 06:13:59,515 INFO L132 encePairwiseOnDemand]: 254/269 looper letters, 307 selfloop transitions, 122 changer transitions 52/633 dead transitions. [2022-01-19 06:13:59,515 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 633 transitions, 5402 flow [2022-01-19 06:13:59,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 06:13:59,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 06:13:59,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2835 transitions. [2022-01-19 06:13:59,524 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.619943144544063 [2022-01-19 06:13:59,524 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2835 transitions. [2022-01-19 06:13:59,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2835 transitions. [2022-01-19 06:13:59,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:13:59,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2835 transitions. [2022-01-19 06:13:59,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 166.76470588235293) internal successors, (2835), 17 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:13:59,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 269.0) internal successors, (4842), 18 states have internal predecessors, (4842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:13:59,543 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 269.0) internal successors, (4842), 18 states have internal predecessors, (4842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:13:59,543 INFO L186 Difference]: Start difference. First operand has 305 places, 507 transitions, 3600 flow. Second operand 17 states and 2835 transitions. [2022-01-19 06:13:59,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 633 transitions, 5402 flow [2022-01-19 06:13:59,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 633 transitions, 5145 flow, removed 96 selfloop flow, removed 9 redundant places. [2022-01-19 06:13:59,770 INFO L242 Difference]: Finished difference. Result has 319 places, 492 transitions, 3776 flow [2022-01-19 06:13:59,770 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=3415, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3776, PETRI_PLACES=319, PETRI_TRANSITIONS=492} [2022-01-19 06:13:59,771 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 90 predicate places. [2022-01-19 06:13:59,771 INFO L470 AbstractCegarLoop]: Abstraction has has 319 places, 492 transitions, 3776 flow [2022-01-19 06:13:59,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 158.57692307692307) internal successors, (4123), 26 states have internal predecessors, (4123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:13:59,771 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:13:59,772 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 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 06:13:59,799 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 06:13:59,987 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,SelfDestructingSolverStorable25 [2022-01-19 06:13:59,987 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:13:59,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:13:59,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1699770320, now seen corresponding path program 1 times [2022-01-19 06:13:59,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:13:59,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179983748] [2022-01-19 06:13:59,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:13:59,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:14:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:14:00,185 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-01-19 06:14:00,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:14:00,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179983748] [2022-01-19 06:14:00,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179983748] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:14:00,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194122702] [2022-01-19 06:14:00,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:14:00,186 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:14:00,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:14:00,187 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 06:14:00,191 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 06:14:00,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:14:00,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-19 06:14:00,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:14:00,354 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-01-19 06:14:00,747 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:14:00,748 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:14:00,791 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:14:00,855 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:14:00,954 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-01-19 06:14:00,987 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-01-19 06:14:00,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:14:01,079 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_897 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_897) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2022-01-19 06:14:01,555 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-01-19 06:14:01,574 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:14:01,575 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-19 06:14:01,588 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 1 not checked. [2022-01-19 06:14:01,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194122702] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:14:01,588 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:14:01,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 26 [2022-01-19 06:14:01,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439832530] [2022-01-19 06:14:01,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:14:01,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-19 06:14:01,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:14:01,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-19 06:14:01,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=503, Unknown=1, NotChecked=46, Total=650 [2022-01-19 06:14:01,591 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 269 [2022-01-19 06:14:01,593 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 492 transitions, 3776 flow. Second operand has 26 states, 26 states have (on average 158.6153846153846) internal successors, (4124), 26 states have internal predecessors, (4124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:14:01,593 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:14:01,593 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 269 [2022-01-19 06:14:01,593 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:14:03,417 INFO L129 PetriNetUnfolder]: 2968/10592 cut-off events. [2022-01-19 06:14:03,417 INFO L130 PetriNetUnfolder]: For 43046/43419 co-relation queries the response was YES. [2022-01-19 06:14:03,476 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32246 conditions, 10592 events. 2968/10592 cut-off events. For 43046/43419 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 125057 event pairs, 460 based on Foata normal form. 110/10334 useless extension candidates. Maximal degree in co-relation 32193. Up to 1921 conditions per place. [2022-01-19 06:14:03,495 INFO L132 encePairwiseOnDemand]: 255/269 looper letters, 240 selfloop transitions, 53 changer transitions 415/876 dead transitions. [2022-01-19 06:14:03,496 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 876 transitions, 9290 flow [2022-01-19 06:14:03,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 06:14:03,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 06:14:03,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2805 transitions. [2022-01-19 06:14:03,499 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6133828996282528 [2022-01-19 06:14:03,499 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2805 transitions. [2022-01-19 06:14:03,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2805 transitions. [2022-01-19 06:14:03,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:14:03,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2805 transitions. [2022-01-19 06:14:03,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 165.0) internal successors, (2805), 17 states have internal predecessors, (2805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:14:03,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 269.0) internal successors, (4842), 18 states have internal predecessors, (4842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:14:03,506 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 269.0) internal successors, (4842), 18 states have internal predecessors, (4842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:14:03,507 INFO L186 Difference]: Start difference. First operand has 319 places, 492 transitions, 3776 flow. Second operand 17 states and 2805 transitions. [2022-01-19 06:14:03,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 876 transitions, 9290 flow [2022-01-19 06:14:03,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 876 transitions, 8833 flow, removed 220 selfloop flow, removed 5 redundant places. [2022-01-19 06:14:03,966 INFO L242 Difference]: Finished difference. Result has 339 places, 376 transitions, 2598 flow [2022-01-19 06:14:03,966 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=3622, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2598, PETRI_PLACES=339, PETRI_TRANSITIONS=376} [2022-01-19 06:14:03,967 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 110 predicate places. [2022-01-19 06:14:03,967 INFO L470 AbstractCegarLoop]: Abstraction has has 339 places, 376 transitions, 2598 flow [2022-01-19 06:14:03,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 158.6153846153846) internal successors, (4124), 26 states have internal predecessors, (4124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:14:03,967 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:14:03,968 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 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] [2022-01-19 06:14:03,983 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 06:14:04,168 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,SelfDestructingSolverStorable26 [2022-01-19 06:14:04,168 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:14:04,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:14:04,168 INFO L85 PathProgramCache]: Analyzing trace with hash 768047308, now seen corresponding path program 2 times [2022-01-19 06:14:04,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:14:04,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140049560] [2022-01-19 06:14:04,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:14:04,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:14:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:14:05,275 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:14:05,275 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:14:05,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140049560] [2022-01-19 06:14:05,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140049560] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:14:05,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709073932] [2022-01-19 06:14:05,275 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 06:14:05,276 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:14:05,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:14:05,277 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 06:14:05,280 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 06:14:05,393 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 06:14:05,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:14:05,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-19 06:14:05,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:14:05,439 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-01-19 06:14:05,783 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:14:05,783 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:14:05,818 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:14:05,961 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:14:05,984 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-01-19 06:14:06,030 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:14:06,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:14:06,092 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_966 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_966) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2022-01-19 06:14:06,113 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_966 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_966) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2022-01-19 06:14:06,595 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-01-19 06:14:06,618 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:14:06,618 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-19 06:14:06,631 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 18 not checked. [2022-01-19 06:14:06,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709073932] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:14:06,631 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:14:06,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11, 11] total 34 [2022-01-19 06:14:06,631 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167213248] [2022-01-19 06:14:06,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:14:06,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-01-19 06:14:06,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:14:06,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-01-19 06:14:06,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=874, Unknown=2, NotChecked=122, Total=1122 [2022-01-19 06:14:06,635 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 269 [2022-01-19 06:14:06,638 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 376 transitions, 2598 flow. Second operand has 34 states, 34 states have (on average 145.44117647058823) internal successors, (4945), 34 states have internal predecessors, (4945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:14:06,638 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:14:06,638 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 269 [2022-01-19 06:14:06,638 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:14:50,794 WARN L228 SmtUtils]: Spent 44.04s on a formula simplification. DAG size of input: 36 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:15:16,834 WARN L228 SmtUtils]: Spent 26.03s on a formula simplification. DAG size of input: 27 DAG size of output: 20 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:15:36,945 WARN L228 SmtUtils]: Spent 20.02s on a formula simplification. DAG size of input: 38 DAG size of output: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:15:39,929 INFO L129 PetriNetUnfolder]: 6397/17804 cut-off events. [2022-01-19 06:15:39,929 INFO L130 PetriNetUnfolder]: For 44649/46087 co-relation queries the response was YES. [2022-01-19 06:15:40,032 INFO L84 FinitePrefix]: Finished finitePrefix Result has 49619 conditions, 17804 events. 6397/17804 cut-off events. For 44649/46087 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 196003 event pairs, 1140 based on Foata normal form. 365/17394 useless extension candidates. Maximal degree in co-relation 49556. Up to 3755 conditions per place. [2022-01-19 06:15:40,064 INFO L132 encePairwiseOnDemand]: 240/269 looper letters, 362 selfloop transitions, 170 changer transitions 194/856 dead transitions. [2022-01-19 06:15:40,065 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 856 transitions, 7577 flow [2022-01-19 06:15:40,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-19 06:15:40,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-01-19 06:15:40,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 4330 transitions. [2022-01-19 06:15:40,070 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5748805098247477 [2022-01-19 06:15:40,070 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 4330 transitions. [2022-01-19 06:15:40,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 4330 transitions. [2022-01-19 06:15:40,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:15:40,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 4330 transitions. [2022-01-19 06:15:40,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 154.64285714285714) internal successors, (4330), 28 states have internal predecessors, (4330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:15:40,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 269.0) internal successors, (7801), 29 states have internal predecessors, (7801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:15:40,081 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 269.0) internal successors, (7801), 29 states have internal predecessors, (7801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:15:40,081 INFO L186 Difference]: Start difference. First operand has 339 places, 376 transitions, 2598 flow. Second operand 28 states and 4330 transitions. [2022-01-19 06:15:40,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 856 transitions, 7577 flow [2022-01-19 06:15:40,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 856 transitions, 7064 flow, removed 52 selfloop flow, removed 19 redundant places. [2022-01-19 06:15:40,636 INFO L242 Difference]: Finished difference. Result has 342 places, 470 transitions, 3932 flow [2022-01-19 06:15:40,636 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=2373, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=3932, PETRI_PLACES=342, PETRI_TRANSITIONS=470} [2022-01-19 06:15:40,636 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 113 predicate places. [2022-01-19 06:15:40,636 INFO L470 AbstractCegarLoop]: Abstraction has has 342 places, 470 transitions, 3932 flow [2022-01-19 06:15:40,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 145.44117647058823) internal successors, (4945), 34 states have internal predecessors, (4945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:15:40,637 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:15:40,638 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 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] [2022-01-19 06:15:40,653 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 06:15:40,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:15:40,838 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:15:40,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:15:40,838 INFO L85 PathProgramCache]: Analyzing trace with hash 196588239, now seen corresponding path program 1 times [2022-01-19 06:15:40,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:15:40,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180219196] [2022-01-19 06:15:40,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:15:40,839 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:15:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:15:40,929 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-01-19 06:15:40,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:15:40,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180219196] [2022-01-19 06:15:40,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180219196] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:15:40,930 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:15:40,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 06:15:40,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906911187] [2022-01-19 06:15:40,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:15:40,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 06:15:40,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:15:40,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 06:15:40,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-19 06:15:40,932 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 269 [2022-01-19 06:15:40,932 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 470 transitions, 3932 flow. Second operand has 7 states, 7 states have (on average 180.71428571428572) internal successors, (1265), 7 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:15:40,932 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:15:40,933 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 269 [2022-01-19 06:15:40,933 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:15:41,755 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([737] L953-6-->L953-7: Formula: (= |v_#memory_int_10| (store |v_#memory_int_11| |v_ULTIMATE.start_main_~#t_ids~0#1.base_3| (store (select |v_#memory_int_11| |v_ULTIMATE.start_main_~#t_ids~0#1.base_3|) (+ |v_ULTIMATE.start_main_~#t_ids~0#1.offset_3| (* |v_ULTIMATE.start_main_~i~3#1_5| 4)) |v_ULTIMATE.start_main_#t~pre45#1_3|))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_3|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_3|, ULTIMATE.start_main_#t~pre45#1=|v_ULTIMATE.start_main_#t~pre45#1_3|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_5|} OutVars{#memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_3|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_3|, ULTIMATE.start_main_#t~pre45#1=|v_ULTIMATE.start_main_#t~pre45#1_3|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_5|} AuxVars[] AssignedVars[#memory_int][210], [Black: 6886#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 6916#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 6889#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 6906#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 6044#(= |~#__global_lock~0.offset| 0), Black: 6902#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 2094#(<= |ULTIMATE.start_main_~i~3#1| 2), Black: 6884#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (forall ((v_ArrVal_966 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_966) |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) (= |~#__global_lock~0.offset| 0)), Black: 6914#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 6904#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 6060#(= |t_funThread1of2ForFork0_#t~mem41#1| 0), Black: 6910#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 6912#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), 1978#(and (= |~#__global_lock~0.offset| 0) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), 177#L953-7true, Black: 6878#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= |~#__global_lock~0.offset| 0) (forall ((v_ArrVal_966 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_966) |~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) (= |~#a~0.offset| 0) (= |~#a~0.base| 4)), Black: 6014#(and (<= 1 |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread2of2ForFork0_~p~0#1.base|)) (= |~#__global_lock~0.offset| 0) (= 4 |t_funThread2of2ForFork0_~p~0#1.base|) (= |t_funThread2of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 6059#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 2015#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (not (= |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#a~0.base|)) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), Black: 6045#(and (= |~#__global_lock~0.offset| 0) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), Black: 5240#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= 4 (+ 4 |~#__global_lock~0.offset|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 6017#(and (<= 1 |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread2of2ForFork0_~p~0#1.base|)) (= |~#__global_lock~0.offset| 0) (= 4 |t_funThread2of2ForFork0_~p~0#1.base|) (= |t_funThread2of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4) (<= 1 |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1|)), Black: 1997#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#a~0.base|)) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|) (= |ULTIMATE.start_main_~i~3#1| 0)), 1316#true, Black: 6007#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread2of2ForFork0_~p~0#1.base|)) (= |~#__global_lock~0.offset| 0) (= 4 |t_funThread2of2ForFork0_~p~0#1.base|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 6011#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread2of2ForFork0_~p~0#1.base|)) (= |~#__global_lock~0.offset| 0) (= 4 |t_funThread2of2ForFork0_~p~0#1.base|) (= |t_funThread2of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 1189#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 938#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1172#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1161#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 1999#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#a~0.base|)) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), Black: 2021#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (not (= |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#a~0.base|)) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (not (= |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), Black: 3616#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 3613#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 3194#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|)), Black: 414#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 720#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 3606#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 3601#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 57#L943-1true, Black: 1332#(<= |ULTIMATE.start_main_~i~1#1| 7), Black: 1769#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1758#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 4408#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 3647#(not (= |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)), 6943#(and (<= |~#__global_lock~0.base| 3) (= (select (select |#pthreadsMutex| |~#__global_lock~0.base|) |~#__global_lock~0.offset|) 1) (not (= |~#a~0.base| |~#__global_lock~0.base|))), Black: 4414#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 3986#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|)), Black: 4418#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 4410#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0)), 410#true, Black: 4412#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 4416#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), 3635#true, 232#true, 4431#true, 205#L944-8true, 2825#true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 5212#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), 6042#true, Black: 5225#(and (= 4 (+ 4 |~#__global_lock~0.offset|)) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (= |~#a~0.base| 4)), Black: 5210#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 5223#(and (= 4 (+ 4 |~#__global_lock~0.offset|)) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (= |~#a~0.base| 4)), Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 5221#(and (= 4 (+ 4 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (= |~#a~0.base| 4)), Black: 5214#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 5206#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), 816#true]) [2022-01-19 06:15:41,755 INFO L384 tUnfolder$Statistics]: this new event has 143 ancestors and is not cut-off event [2022-01-19 06:15:41,755 INFO L387 tUnfolder$Statistics]: existing Event has 143 ancestors and is not cut-off event [2022-01-19 06:15:41,756 INFO L387 tUnfolder$Statistics]: existing Event has 143 ancestors and is not cut-off event [2022-01-19 06:15:41,756 INFO L387 tUnfolder$Statistics]: existing Event has 143 ancestors and is not cut-off event [2022-01-19 06:15:41,876 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([737] L953-6-->L953-7: Formula: (= |v_#memory_int_10| (store |v_#memory_int_11| |v_ULTIMATE.start_main_~#t_ids~0#1.base_3| (store (select |v_#memory_int_11| |v_ULTIMATE.start_main_~#t_ids~0#1.base_3|) (+ |v_ULTIMATE.start_main_~#t_ids~0#1.offset_3| (* |v_ULTIMATE.start_main_~i~3#1_5| 4)) |v_ULTIMATE.start_main_#t~pre45#1_3|))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_3|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_3|, ULTIMATE.start_main_#t~pre45#1=|v_ULTIMATE.start_main_#t~pre45#1_3|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_5|} OutVars{#memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_3|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_3|, ULTIMATE.start_main_#t~pre45#1=|v_ULTIMATE.start_main_#t~pre45#1_3|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_5|} AuxVars[] AssignedVars[#memory_int][210], [Black: 6886#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 6916#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 6889#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 6906#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 6044#(= |~#__global_lock~0.offset| 0), Black: 6902#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 2094#(<= |ULTIMATE.start_main_~i~3#1| 2), Black: 6884#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (forall ((v_ArrVal_966 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_966) |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) (= |~#__global_lock~0.offset| 0)), Black: 6914#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 6904#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 6060#(= |t_funThread1of2ForFork0_#t~mem41#1| 0), Black: 6910#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 6912#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), 1978#(and (= |~#__global_lock~0.offset| 0) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), 177#L953-7true, Black: 6878#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= |~#__global_lock~0.offset| 0) (forall ((v_ArrVal_966 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_966) |~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) (= |~#a~0.offset| 0) (= |~#a~0.base| 4)), Black: 6014#(and (<= 1 |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread2of2ForFork0_~p~0#1.base|)) (= |~#__global_lock~0.offset| 0) (= 4 |t_funThread2of2ForFork0_~p~0#1.base|) (= |t_funThread2of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 6059#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 2015#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (not (= |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#a~0.base|)) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), Black: 6045#(and (= |~#__global_lock~0.offset| 0) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), Black: 5240#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= 4 (+ 4 |~#__global_lock~0.offset|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 6017#(and (<= 1 |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread2of2ForFork0_~p~0#1.base|)) (= |~#__global_lock~0.offset| 0) (= 4 |t_funThread2of2ForFork0_~p~0#1.base|) (= |t_funThread2of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4) (<= 1 |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1|)), Black: 1997#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#a~0.base|)) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|) (= |ULTIMATE.start_main_~i~3#1| 0)), 1316#true, Black: 6007#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread2of2ForFork0_~p~0#1.base|)) (= |~#__global_lock~0.offset| 0) (= 4 |t_funThread2of2ForFork0_~p~0#1.base|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), 39#L944-28true, Black: 6011#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread2of2ForFork0_~p~0#1.base|)) (= |~#__global_lock~0.offset| 0) (= 4 |t_funThread2of2ForFork0_~p~0#1.base|) (= |t_funThread2of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 1189#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 938#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1172#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1161#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 1999#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#a~0.base|)) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), Black: 2021#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (not (= |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#a~0.base|)) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (not (= |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), Black: 3616#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 3613#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 3194#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|)), Black: 414#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 720#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 3606#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 3601#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1332#(<= |ULTIMATE.start_main_~i~1#1| 7), Black: 1769#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1758#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 4408#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), 88#L944-11true, Black: 3647#(not (= |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)), 6943#(and (<= |~#__global_lock~0.base| 3) (= (select (select |#pthreadsMutex| |~#__global_lock~0.base|) |~#__global_lock~0.offset|) 1) (not (= |~#a~0.base| |~#__global_lock~0.base|))), Black: 4414#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 3986#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|)), Black: 4418#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 4410#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0)), 410#true, Black: 4412#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 4416#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), 3635#true, 232#true, 4431#true, 2825#true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 5212#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), 6042#true, Black: 5225#(and (= 4 (+ 4 |~#__global_lock~0.offset|)) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (= |~#a~0.base| 4)), Black: 5210#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 5223#(and (= 4 (+ 4 |~#__global_lock~0.offset|)) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (= |~#a~0.base| 4)), Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 5221#(and (= 4 (+ 4 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (= |~#a~0.base| 4)), Black: 5214#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 5206#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), 816#true]) [2022-01-19 06:15:41,877 INFO L384 tUnfolder$Statistics]: this new event has 151 ancestors and is not cut-off event [2022-01-19 06:15:41,877 INFO L387 tUnfolder$Statistics]: existing Event has 151 ancestors and is not cut-off event [2022-01-19 06:15:41,877 INFO L387 tUnfolder$Statistics]: existing Event has 151 ancestors and is not cut-off event [2022-01-19 06:15:41,877 INFO L387 tUnfolder$Statistics]: existing Event has 151 ancestors and is not cut-off event [2022-01-19 06:15:41,904 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([737] L953-6-->L953-7: Formula: (= |v_#memory_int_10| (store |v_#memory_int_11| |v_ULTIMATE.start_main_~#t_ids~0#1.base_3| (store (select |v_#memory_int_11| |v_ULTIMATE.start_main_~#t_ids~0#1.base_3|) (+ |v_ULTIMATE.start_main_~#t_ids~0#1.offset_3| (* |v_ULTIMATE.start_main_~i~3#1_5| 4)) |v_ULTIMATE.start_main_#t~pre45#1_3|))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_3|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_3|, ULTIMATE.start_main_#t~pre45#1=|v_ULTIMATE.start_main_#t~pre45#1_3|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_5|} OutVars{#memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_3|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_3|, ULTIMATE.start_main_#t~pre45#1=|v_ULTIMATE.start_main_#t~pre45#1_3|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_5|} AuxVars[] AssignedVars[#memory_int][210], [Black: 6886#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 6916#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 6889#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 6906#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 6044#(= |~#__global_lock~0.offset| 0), Black: 6902#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 2094#(<= |ULTIMATE.start_main_~i~3#1| 2), Black: 6884#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (forall ((v_ArrVal_966 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_966) |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) (= |~#__global_lock~0.offset| 0)), Black: 6914#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 6904#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 6060#(= |t_funThread1of2ForFork0_#t~mem41#1| 0), Black: 6910#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), 177#L953-7true, Black: 6912#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), 1978#(and (= |~#__global_lock~0.offset| 0) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), Black: 6878#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= |~#__global_lock~0.offset| 0) (forall ((v_ArrVal_966 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_966) |~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) (= |~#a~0.offset| 0) (= |~#a~0.base| 4)), Black: 2015#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (not (= |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#a~0.base|)) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), Black: 6014#(and (<= 1 |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread2of2ForFork0_~p~0#1.base|)) (= |~#__global_lock~0.offset| 0) (= 4 |t_funThread2of2ForFork0_~p~0#1.base|) (= |t_funThread2of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 6059#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 6045#(and (= |~#__global_lock~0.offset| 0) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), Black: 5240#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= 4 (+ 4 |~#__global_lock~0.offset|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 6017#(and (<= 1 |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread2of2ForFork0_~p~0#1.base|)) (= |~#__global_lock~0.offset| 0) (= 4 |t_funThread2of2ForFork0_~p~0#1.base|) (= |t_funThread2of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4) (<= 1 |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1|)), Black: 1997#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#a~0.base|)) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|) (= |ULTIMATE.start_main_~i~3#1| 0)), 1316#true, Black: 6007#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread2of2ForFork0_~p~0#1.base|)) (= |~#__global_lock~0.offset| 0) (= 4 |t_funThread2of2ForFork0_~p~0#1.base|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 6011#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread2of2ForFork0_~p~0#1.base|)) (= |~#__global_lock~0.offset| 0) (= 4 |t_funThread2of2ForFork0_~p~0#1.base|) (= |t_funThread2of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 1189#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 938#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1172#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1161#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 1999#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#a~0.base|)) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), Black: 2021#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (not (= |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#a~0.base|)) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (not (= |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), Black: 3616#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 3613#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 3194#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|)), Black: 414#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 720#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 3606#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 3601#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1332#(<= |ULTIMATE.start_main_~i~1#1| 7), Black: 1769#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1758#(< |ULTIMATE.start_main_~i~1#1| 10), 184#L944-30true, Black: 4408#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), 88#L944-11true, Black: 3647#(not (= |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)), 6943#(and (<= |~#__global_lock~0.base| 3) (= (select (select |#pthreadsMutex| |~#__global_lock~0.base|) |~#__global_lock~0.offset|) 1) (not (= |~#a~0.base| |~#__global_lock~0.base|))), Black: 4414#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 3986#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|)), Black: 4418#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 4410#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0)), 410#true, Black: 4412#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 4416#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), 3635#true, 4431#true, 232#true, 2825#true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 5212#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), 6042#true, Black: 5225#(and (= 4 (+ 4 |~#__global_lock~0.offset|)) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (= |~#a~0.base| 4)), Black: 5210#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 5223#(and (= 4 (+ 4 |~#__global_lock~0.offset|)) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (= |~#a~0.base| 4)), Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 5221#(and (= 4 (+ 4 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (= |~#a~0.base| 4)), Black: 5214#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 5206#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), 816#true]) [2022-01-19 06:15:41,904 INFO L384 tUnfolder$Statistics]: this new event has 153 ancestors and is not cut-off event [2022-01-19 06:15:41,904 INFO L387 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-01-19 06:15:41,904 INFO L387 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-01-19 06:15:41,905 INFO L387 tUnfolder$Statistics]: existing Event has 153 ancestors and is not cut-off event [2022-01-19 06:15:41,958 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([737] L953-6-->L953-7: Formula: (= |v_#memory_int_10| (store |v_#memory_int_11| |v_ULTIMATE.start_main_~#t_ids~0#1.base_3| (store (select |v_#memory_int_11| |v_ULTIMATE.start_main_~#t_ids~0#1.base_3|) (+ |v_ULTIMATE.start_main_~#t_ids~0#1.offset_3| (* |v_ULTIMATE.start_main_~i~3#1_5| 4)) |v_ULTIMATE.start_main_#t~pre45#1_3|))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_3|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_3|, ULTIMATE.start_main_#t~pre45#1=|v_ULTIMATE.start_main_#t~pre45#1_3|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_5|} OutVars{#memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_3|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_3|, ULTIMATE.start_main_#t~pre45#1=|v_ULTIMATE.start_main_#t~pre45#1_3|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_5|} AuxVars[] AssignedVars[#memory_int][210], [Black: 6886#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 6916#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 6889#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 6906#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 6044#(= |~#__global_lock~0.offset| 0), 2094#(<= |ULTIMATE.start_main_~i~3#1| 2), Black: 6902#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 6884#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (forall ((v_ArrVal_966 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_966) |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) (= |~#__global_lock~0.offset| 0)), Black: 6914#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 6904#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 6060#(= |t_funThread1of2ForFork0_#t~mem41#1| 0), Black: 6910#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), 1978#(and (= |~#__global_lock~0.offset| 0) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), Black: 6912#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), 177#L953-7true, Black: 6878#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= |~#__global_lock~0.offset| 0) (forall ((v_ArrVal_966 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_966) |~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) (= |~#a~0.offset| 0) (= |~#a~0.base| 4)), Black: 6059#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 6014#(and (<= 1 |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread2of2ForFork0_~p~0#1.base|)) (= |~#__global_lock~0.offset| 0) (= 4 |t_funThread2of2ForFork0_~p~0#1.base|) (= |t_funThread2of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 2015#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (not (= |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#a~0.base|)) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), Black: 6045#(and (= |~#__global_lock~0.offset| 0) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), Black: 5240#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= 4 (+ 4 |~#__global_lock~0.offset|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 6017#(and (<= 1 |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread2of2ForFork0_~p~0#1.base|)) (= |~#__global_lock~0.offset| 0) (= 4 |t_funThread2of2ForFork0_~p~0#1.base|) (= |t_funThread2of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4) (<= 1 |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1|)), Black: 1997#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#a~0.base|)) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|) (= |ULTIMATE.start_main_~i~3#1| 0)), 1316#true, Black: 6007#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread2of2ForFork0_~p~0#1.base|)) (= |~#__global_lock~0.offset| 0) (= 4 |t_funThread2of2ForFork0_~p~0#1.base|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 6011#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread2of2ForFork0_~p~0#1.base|)) (= |~#__global_lock~0.offset| 0) (= 4 |t_funThread2of2ForFork0_~p~0#1.base|) (= |t_funThread2of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 1189#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 938#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1172#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1161#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 1999#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#a~0.base|)) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), Black: 2021#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (not (= |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#a~0.base|)) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (not (= |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), Black: 3616#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 3613#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 3194#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|)), Black: 414#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 720#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 3606#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 3601#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1332#(<= |ULTIMATE.start_main_~i~1#1| 7), Black: 1769#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1758#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 4408#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), 88#L944-11true, Black: 3647#(not (= |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)), 6943#(and (<= |~#__global_lock~0.base| 3) (= (select (select |#pthreadsMutex| |~#__global_lock~0.base|) |~#__global_lock~0.offset|) 1) (not (= |~#a~0.base| |~#__global_lock~0.base|))), Black: 4414#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 131#L929-2true, Black: 3986#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|)), Black: 4418#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 4410#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0)), 410#true, Black: 4412#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 4416#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), 3635#true, 232#true, 4431#true, 2825#true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 5212#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), 6042#true, Black: 5225#(and (= 4 (+ 4 |~#__global_lock~0.offset|)) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (= |~#a~0.base| 4)), Black: 5210#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 5223#(and (= 4 (+ 4 |~#__global_lock~0.offset|)) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (= |~#a~0.base| 4)), Black: 5221#(and (= 4 (+ 4 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (= |~#a~0.base| 4)), Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 5214#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 5206#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), 816#true]) [2022-01-19 06:15:41,958 INFO L384 tUnfolder$Statistics]: this new event has 158 ancestors and is not cut-off event [2022-01-19 06:15:41,958 INFO L387 tUnfolder$Statistics]: existing Event has 158 ancestors and is not cut-off event [2022-01-19 06:15:41,958 INFO L387 tUnfolder$Statistics]: existing Event has 158 ancestors and is not cut-off event [2022-01-19 06:15:41,958 INFO L387 tUnfolder$Statistics]: existing Event has 158 ancestors and is not cut-off event [2022-01-19 06:15:41,978 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([737] L953-6-->L953-7: Formula: (= |v_#memory_int_10| (store |v_#memory_int_11| |v_ULTIMATE.start_main_~#t_ids~0#1.base_3| (store (select |v_#memory_int_11| |v_ULTIMATE.start_main_~#t_ids~0#1.base_3|) (+ |v_ULTIMATE.start_main_~#t_ids~0#1.offset_3| (* |v_ULTIMATE.start_main_~i~3#1_5| 4)) |v_ULTIMATE.start_main_#t~pre45#1_3|))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_3|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_3|, ULTIMATE.start_main_#t~pre45#1=|v_ULTIMATE.start_main_#t~pre45#1_3|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_5|} OutVars{#memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_3|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_3|, ULTIMATE.start_main_#t~pre45#1=|v_ULTIMATE.start_main_#t~pre45#1_3|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_5|} AuxVars[] AssignedVars[#memory_int][210], [Black: 6886#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 6916#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 6889#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 6906#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 6044#(= |~#__global_lock~0.offset| 0), Black: 6902#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 2094#(<= |ULTIMATE.start_main_~i~3#1| 2), Black: 6884#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (forall ((v_ArrVal_966 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_966) |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) (= |~#__global_lock~0.offset| 0)), Black: 6914#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 6904#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 6060#(= |t_funThread1of2ForFork0_#t~mem41#1| 0), Black: 6910#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 6912#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), 1978#(and (= |~#__global_lock~0.offset| 0) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), 177#L953-7true, Black: 6878#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= |~#__global_lock~0.offset| 0) (forall ((v_ArrVal_966 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_966) |~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) (= |~#a~0.offset| 0) (= |~#a~0.base| 4)), Black: 6014#(and (<= 1 |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread2of2ForFork0_~p~0#1.base|)) (= |~#__global_lock~0.offset| 0) (= 4 |t_funThread2of2ForFork0_~p~0#1.base|) (= |t_funThread2of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 6059#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 2015#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (not (= |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#a~0.base|)) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), 185#L944-21true, Black: 6045#(and (= |~#__global_lock~0.offset| 0) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), Black: 5240#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= 4 (+ 4 |~#__global_lock~0.offset|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 6017#(and (<= 1 |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread2of2ForFork0_~p~0#1.base|)) (= |~#__global_lock~0.offset| 0) (= 4 |t_funThread2of2ForFork0_~p~0#1.base|) (= |t_funThread2of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4) (<= 1 |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1|)), Black: 1997#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#a~0.base|)) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|) (= |ULTIMATE.start_main_~i~3#1| 0)), 1316#true, Black: 6007#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread2of2ForFork0_~p~0#1.base|)) (= |~#__global_lock~0.offset| 0) (= 4 |t_funThread2of2ForFork0_~p~0#1.base|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), 39#L944-28true, Black: 6011#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread2of2ForFork0_~p~0#1.base|)) (= |~#__global_lock~0.offset| 0) (= 4 |t_funThread2of2ForFork0_~p~0#1.base|) (= |t_funThread2of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 1189#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 938#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1172#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1161#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 1999#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#a~0.base|)) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), Black: 2021#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (not (= |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#a~0.base|)) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (not (= |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), Black: 3616#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 3613#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 3194#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|)), Black: 414#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 720#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 3606#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 3601#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1332#(<= |ULTIMATE.start_main_~i~1#1| 7), Black: 1769#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1758#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 4408#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 3647#(not (= |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)), 6943#(and (<= |~#__global_lock~0.base| 3) (= (select (select |#pthreadsMutex| |~#__global_lock~0.base|) |~#__global_lock~0.offset|) 1) (not (= |~#a~0.base| |~#__global_lock~0.base|))), Black: 4414#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 3986#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|)), Black: 4418#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 4410#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0)), 410#true, Black: 4412#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 4416#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), 3635#true, 232#true, 4431#true, 2825#true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 5212#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), 6042#true, Black: 5225#(and (= 4 (+ 4 |~#__global_lock~0.offset|)) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (= |~#a~0.base| 4)), Black: 5210#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 5223#(and (= 4 (+ 4 |~#__global_lock~0.offset|)) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (= |~#a~0.base| 4)), Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 5221#(and (= 4 (+ 4 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (= |~#a~0.base| 4)), Black: 5214#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 5206#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), 816#true]) [2022-01-19 06:15:41,978 INFO L384 tUnfolder$Statistics]: this new event has 160 ancestors and is not cut-off event [2022-01-19 06:15:41,978 INFO L387 tUnfolder$Statistics]: existing Event has 160 ancestors and is not cut-off event [2022-01-19 06:15:41,978 INFO L387 tUnfolder$Statistics]: existing Event has 160 ancestors and is not cut-off event [2022-01-19 06:15:41,978 INFO L387 tUnfolder$Statistics]: existing Event has 160 ancestors and is not cut-off event [2022-01-19 06:15:42,000 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([737] L953-6-->L953-7: Formula: (= |v_#memory_int_10| (store |v_#memory_int_11| |v_ULTIMATE.start_main_~#t_ids~0#1.base_3| (store (select |v_#memory_int_11| |v_ULTIMATE.start_main_~#t_ids~0#1.base_3|) (+ |v_ULTIMATE.start_main_~#t_ids~0#1.offset_3| (* |v_ULTIMATE.start_main_~i~3#1_5| 4)) |v_ULTIMATE.start_main_#t~pre45#1_3|))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_3|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_3|, ULTIMATE.start_main_#t~pre45#1=|v_ULTIMATE.start_main_#t~pre45#1_3|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_5|} OutVars{#memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_3|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_3|, ULTIMATE.start_main_#t~pre45#1=|v_ULTIMATE.start_main_#t~pre45#1_3|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_5|} AuxVars[] AssignedVars[#memory_int][210], [Black: 6886#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 6916#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 6889#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 6906#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 6044#(= |~#__global_lock~0.offset| 0), Black: 6902#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 2094#(<= |ULTIMATE.start_main_~i~3#1| 2), Black: 6884#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (forall ((v_ArrVal_966 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_966) |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) (= |~#__global_lock~0.offset| 0)), Black: 6914#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 6904#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 6060#(= |t_funThread1of2ForFork0_#t~mem41#1| 0), Black: 6910#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 6912#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), 1978#(and (= |~#__global_lock~0.offset| 0) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), 177#L953-7true, Black: 6878#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= |~#__global_lock~0.offset| 0) (forall ((v_ArrVal_966 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_966) |~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) (= |~#a~0.offset| 0) (= |~#a~0.base| 4)), Black: 6014#(and (<= 1 |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread2of2ForFork0_~p~0#1.base|)) (= |~#__global_lock~0.offset| 0) (= 4 |t_funThread2of2ForFork0_~p~0#1.base|) (= |t_funThread2of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 6059#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 2015#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (not (= |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#a~0.base|)) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), 185#L944-21true, Black: 6045#(and (= |~#__global_lock~0.offset| 0) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), Black: 5240#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= 4 (+ 4 |~#__global_lock~0.offset|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 6017#(and (<= 1 |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread2of2ForFork0_~p~0#1.base|)) (= |~#__global_lock~0.offset| 0) (= 4 |t_funThread2of2ForFork0_~p~0#1.base|) (= |t_funThread2of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4) (<= 1 |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1|)), Black: 1997#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#a~0.base|)) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|) (= |ULTIMATE.start_main_~i~3#1| 0)), 1316#true, Black: 6007#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread2of2ForFork0_~p~0#1.base|)) (= |~#__global_lock~0.offset| 0) (= 4 |t_funThread2of2ForFork0_~p~0#1.base|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 6011#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread2of2ForFork0_~p~0#1.base|)) (= |~#__global_lock~0.offset| 0) (= 4 |t_funThread2of2ForFork0_~p~0#1.base|) (= |t_funThread2of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 1189#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 938#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1172#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1161#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 1999#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#a~0.base|)) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), Black: 2021#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (not (= |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#a~0.base|)) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (not (= |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), Black: 3616#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 3613#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 3194#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|)), Black: 414#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 720#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 3606#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 3601#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1332#(<= |ULTIMATE.start_main_~i~1#1| 7), Black: 1769#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1758#(< |ULTIMATE.start_main_~i~1#1| 10), 184#L944-30true, Black: 4408#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), 6943#(and (<= |~#__global_lock~0.base| 3) (= (select (select |#pthreadsMutex| |~#__global_lock~0.base|) |~#__global_lock~0.offset|) 1) (not (= |~#a~0.base| |~#__global_lock~0.base|))), Black: 3647#(not (= |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)), Black: 4414#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 3986#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|)), Black: 4418#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 4410#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0)), 410#true, Black: 4412#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 4416#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), 3635#true, 232#true, 4431#true, 2825#true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 5212#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), 6042#true, Black: 5225#(and (= 4 (+ 4 |~#__global_lock~0.offset|)) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (= |~#a~0.base| 4)), Black: 5210#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 5223#(and (= 4 (+ 4 |~#__global_lock~0.offset|)) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (= |~#a~0.base| 4)), Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 5221#(and (= 4 (+ 4 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (= |~#a~0.base| 4)), Black: 5214#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 5206#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), 816#true]) [2022-01-19 06:15:42,000 INFO L384 tUnfolder$Statistics]: this new event has 162 ancestors and is not cut-off event [2022-01-19 06:15:42,000 INFO L387 tUnfolder$Statistics]: existing Event has 162 ancestors and is not cut-off event [2022-01-19 06:15:42,000 INFO L387 tUnfolder$Statistics]: existing Event has 162 ancestors and is not cut-off event [2022-01-19 06:15:42,000 INFO L387 tUnfolder$Statistics]: existing Event has 162 ancestors and is not cut-off event [2022-01-19 06:15:42,018 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([737] L953-6-->L953-7: Formula: (= |v_#memory_int_10| (store |v_#memory_int_11| |v_ULTIMATE.start_main_~#t_ids~0#1.base_3| (store (select |v_#memory_int_11| |v_ULTIMATE.start_main_~#t_ids~0#1.base_3|) (+ |v_ULTIMATE.start_main_~#t_ids~0#1.offset_3| (* |v_ULTIMATE.start_main_~i~3#1_5| 4)) |v_ULTIMATE.start_main_#t~pre45#1_3|))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_3|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_3|, ULTIMATE.start_main_#t~pre45#1=|v_ULTIMATE.start_main_#t~pre45#1_3|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_5|} OutVars{#memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_3|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_3|, ULTIMATE.start_main_#t~pre45#1=|v_ULTIMATE.start_main_#t~pre45#1_3|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_5|} AuxVars[] AssignedVars[#memory_int][210], [Black: 6886#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 6916#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 6889#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 6906#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 6044#(= |~#__global_lock~0.offset| 0), Black: 6902#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 2094#(<= |ULTIMATE.start_main_~i~3#1| 2), Black: 6884#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (forall ((v_ArrVal_966 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_966) |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) (= |~#__global_lock~0.offset| 0)), Black: 6914#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 6904#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 6060#(= |t_funThread1of2ForFork0_#t~mem41#1| 0), Black: 6910#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 6912#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), 1978#(and (= |~#__global_lock~0.offset| 0) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), 177#L953-7true, Black: 6878#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= |~#__global_lock~0.offset| 0) (forall ((v_ArrVal_966 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_966) |~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) (= |~#a~0.offset| 0) (= |~#a~0.base| 4)), Black: 6014#(and (<= 1 |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread2of2ForFork0_~p~0#1.base|)) (= |~#__global_lock~0.offset| 0) (= 4 |t_funThread2of2ForFork0_~p~0#1.base|) (= |t_funThread2of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 6059#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 2015#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (not (= |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#a~0.base|)) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), Black: 6045#(and (= |~#__global_lock~0.offset| 0) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), Black: 5240#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= 4 (+ 4 |~#__global_lock~0.offset|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 6017#(and (<= 1 |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread2of2ForFork0_~p~0#1.base|)) (= |~#__global_lock~0.offset| 0) (= 4 |t_funThread2of2ForFork0_~p~0#1.base|) (= |t_funThread2of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4) (<= 1 |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1|)), Black: 1997#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#a~0.base|)) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|) (= |ULTIMATE.start_main_~i~3#1| 0)), 1316#true, Black: 6007#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread2of2ForFork0_~p~0#1.base|)) (= |~#__global_lock~0.offset| 0) (= 4 |t_funThread2of2ForFork0_~p~0#1.base|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), 39#L944-28true, Black: 6011#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread2of2ForFork0_~p~0#1.base|)) (= |~#__global_lock~0.offset| 0) (= 4 |t_funThread2of2ForFork0_~p~0#1.base|) (= |t_funThread2of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 1189#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 938#(<= |ULTIMATE.start_main_~i~1#1| 3), 121#L946true, Black: 1172#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1161#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 1999#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#a~0.base|)) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), Black: 2021#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (not (= |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#a~0.base|)) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (not (= |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), Black: 3616#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 3613#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 3194#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|)), Black: 414#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 720#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 3606#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 3601#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1332#(<= |ULTIMATE.start_main_~i~1#1| 7), Black: 1769#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1758#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 4408#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 3647#(not (= |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)), 6943#(and (<= |~#__global_lock~0.base| 3) (= (select (select |#pthreadsMutex| |~#__global_lock~0.base|) |~#__global_lock~0.offset|) 1) (not (= |~#a~0.base| |~#__global_lock~0.base|))), Black: 4414#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 3986#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|)), Black: 4418#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 4410#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0)), 410#true, Black: 4412#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 4416#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), 3635#true, 232#true, 4431#true, 2825#true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 5212#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), 6042#true, Black: 5225#(and (= 4 (+ 4 |~#__global_lock~0.offset|)) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (= |~#a~0.base| 4)), Black: 5210#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 5223#(and (= 4 (+ 4 |~#__global_lock~0.offset|)) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (= |~#a~0.base| 4)), Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 5221#(and (= 4 (+ 4 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (= |~#a~0.base| 4)), Black: 5214#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 5206#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), 816#true]) [2022-01-19 06:15:42,018 INFO L384 tUnfolder$Statistics]: this new event has 164 ancestors and is not cut-off event [2022-01-19 06:15:42,018 INFO L387 tUnfolder$Statistics]: existing Event has 164 ancestors and is not cut-off event [2022-01-19 06:15:42,018 INFO L387 tUnfolder$Statistics]: existing Event has 164 ancestors and is not cut-off event [2022-01-19 06:15:42,018 INFO L387 tUnfolder$Statistics]: existing Event has 164 ancestors and is not cut-off event [2022-01-19 06:15:42,026 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([737] L953-6-->L953-7: Formula: (= |v_#memory_int_10| (store |v_#memory_int_11| |v_ULTIMATE.start_main_~#t_ids~0#1.base_3| (store (select |v_#memory_int_11| |v_ULTIMATE.start_main_~#t_ids~0#1.base_3|) (+ |v_ULTIMATE.start_main_~#t_ids~0#1.offset_3| (* |v_ULTIMATE.start_main_~i~3#1_5| 4)) |v_ULTIMATE.start_main_#t~pre45#1_3|))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_3|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_3|, ULTIMATE.start_main_#t~pre45#1=|v_ULTIMATE.start_main_#t~pre45#1_3|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_5|} OutVars{#memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_3|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_3|, ULTIMATE.start_main_#t~pre45#1=|v_ULTIMATE.start_main_#t~pre45#1_3|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_5|} AuxVars[] AssignedVars[#memory_int][210], [Black: 6886#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 6916#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 6889#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 6906#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 6044#(= |~#__global_lock~0.offset| 0), Black: 6902#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 2094#(<= |ULTIMATE.start_main_~i~3#1| 2), Black: 6884#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (forall ((v_ArrVal_966 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_966) |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) (= |~#__global_lock~0.offset| 0)), Black: 6914#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 6904#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 6060#(= |t_funThread1of2ForFork0_#t~mem41#1| 0), Black: 6910#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 6912#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), 1978#(and (= |~#__global_lock~0.offset| 0) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), 177#L953-7true, Black: 6878#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= |~#__global_lock~0.offset| 0) (forall ((v_ArrVal_966 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_966) |~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) (= |~#a~0.offset| 0) (= |~#a~0.base| 4)), Black: 6014#(and (<= 1 |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread2of2ForFork0_~p~0#1.base|)) (= |~#__global_lock~0.offset| 0) (= 4 |t_funThread2of2ForFork0_~p~0#1.base|) (= |t_funThread2of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 6059#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 2015#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (not (= |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#a~0.base|)) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), Black: 6045#(and (= |~#__global_lock~0.offset| 0) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), Black: 5240#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= 4 (+ 4 |~#__global_lock~0.offset|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 6017#(and (<= 1 |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread2of2ForFork0_~p~0#1.base|)) (= |~#__global_lock~0.offset| 0) (= 4 |t_funThread2of2ForFork0_~p~0#1.base|) (= |t_funThread2of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4) (<= 1 |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1|)), Black: 1997#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#a~0.base|)) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|) (= |ULTIMATE.start_main_~i~3#1| 0)), 1316#true, Black: 6007#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread2of2ForFork0_~p~0#1.base|)) (= |~#__global_lock~0.offset| 0) (= 4 |t_funThread2of2ForFork0_~p~0#1.base|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 6011#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread2of2ForFork0_~p~0#1.base|)) (= |~#__global_lock~0.offset| 0) (= 4 |t_funThread2of2ForFork0_~p~0#1.base|) (= |t_funThread2of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 1189#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 938#(<= |ULTIMATE.start_main_~i~1#1| 3), 121#L946true, Black: 1172#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1161#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 1999#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#a~0.base|)) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), Black: 2021#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (not (= |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#a~0.base|)) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (not (= |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), Black: 3616#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 3613#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 3194#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|)), Black: 414#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 720#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 3606#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 3601#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1332#(<= |ULTIMATE.start_main_~i~1#1| 7), Black: 1769#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1758#(< |ULTIMATE.start_main_~i~1#1| 10), 184#L944-30true, Black: 4408#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), 6943#(and (<= |~#__global_lock~0.base| 3) (= (select (select |#pthreadsMutex| |~#__global_lock~0.base|) |~#__global_lock~0.offset|) 1) (not (= |~#a~0.base| |~#__global_lock~0.base|))), Black: 3647#(not (= |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)), Black: 4414#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 3986#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|)), Black: 4418#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 4410#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0)), 410#true, Black: 4412#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 4416#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), 3635#true, 232#true, 4431#true, 2825#true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 5212#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), 6042#true, Black: 5225#(and (= 4 (+ 4 |~#__global_lock~0.offset|)) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (= |~#a~0.base| 4)), Black: 5210#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 5223#(and (= 4 (+ 4 |~#__global_lock~0.offset|)) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (= |~#a~0.base| 4)), Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 5221#(and (= 4 (+ 4 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (= |~#a~0.base| 4)), Black: 5214#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 5206#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), 816#true]) [2022-01-19 06:15:42,026 INFO L384 tUnfolder$Statistics]: this new event has 166 ancestors and is not cut-off event [2022-01-19 06:15:42,026 INFO L387 tUnfolder$Statistics]: existing Event has 166 ancestors and is not cut-off event [2022-01-19 06:15:42,026 INFO L387 tUnfolder$Statistics]: existing Event has 166 ancestors and is not cut-off event [2022-01-19 06:15:42,026 INFO L387 tUnfolder$Statistics]: existing Event has 166 ancestors and is not cut-off event [2022-01-19 06:15:42,029 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([737] L953-6-->L953-7: Formula: (= |v_#memory_int_10| (store |v_#memory_int_11| |v_ULTIMATE.start_main_~#t_ids~0#1.base_3| (store (select |v_#memory_int_11| |v_ULTIMATE.start_main_~#t_ids~0#1.base_3|) (+ |v_ULTIMATE.start_main_~#t_ids~0#1.offset_3| (* |v_ULTIMATE.start_main_~i~3#1_5| 4)) |v_ULTIMATE.start_main_#t~pre45#1_3|))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_3|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_3|, ULTIMATE.start_main_#t~pre45#1=|v_ULTIMATE.start_main_#t~pre45#1_3|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_5|} OutVars{#memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_3|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_3|, ULTIMATE.start_main_#t~pre45#1=|v_ULTIMATE.start_main_#t~pre45#1_3|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_5|} AuxVars[] AssignedVars[#memory_int][210], [Black: 6886#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 6916#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 6889#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 6906#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 6044#(= |~#__global_lock~0.offset| 0), Black: 6902#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 2094#(<= |ULTIMATE.start_main_~i~3#1| 2), Black: 6884#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (forall ((v_ArrVal_966 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_966) |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) (= |~#__global_lock~0.offset| 0)), Black: 6914#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 6904#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 6060#(= |t_funThread1of2ForFork0_#t~mem41#1| 0), Black: 6910#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), 177#L953-7true, 1978#(and (= |~#__global_lock~0.offset| 0) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), Black: 6912#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 6878#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= |~#__global_lock~0.offset| 0) (forall ((v_ArrVal_966 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_966) |~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) (= |~#a~0.offset| 0) (= |~#a~0.base| 4)), Black: 6014#(and (<= 1 |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread2of2ForFork0_~p~0#1.base|)) (= |~#__global_lock~0.offset| 0) (= 4 |t_funThread2of2ForFork0_~p~0#1.base|) (= |t_funThread2of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 2015#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (not (= |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#a~0.base|)) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), Black: 6059#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), 185#L944-21true, Black: 6045#(and (= |~#__global_lock~0.offset| 0) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), Black: 5240#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= 4 (+ 4 |~#__global_lock~0.offset|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 6017#(and (<= 1 |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread2of2ForFork0_~p~0#1.base|)) (= |~#__global_lock~0.offset| 0) (= 4 |t_funThread2of2ForFork0_~p~0#1.base|) (= |t_funThread2of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4) (<= 1 |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1|)), Black: 1997#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#a~0.base|)) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|) (= |ULTIMATE.start_main_~i~3#1| 0)), 1316#true, Black: 6007#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread2of2ForFork0_~p~0#1.base|)) (= |~#__global_lock~0.offset| 0) (= 4 |t_funThread2of2ForFork0_~p~0#1.base|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 6011#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread2of2ForFork0_~p~0#1.base|)) (= |~#__global_lock~0.offset| 0) (= 4 |t_funThread2of2ForFork0_~p~0#1.base|) (= |t_funThread2of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 1189#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 938#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1172#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1161#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 1999#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#a~0.base|)) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), Black: 2021#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (not (= |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#a~0.base|)) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (not (= |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), Black: 3616#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 3613#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 3194#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|)), Black: 414#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 720#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 3606#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 3601#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1332#(<= |ULTIMATE.start_main_~i~1#1| 7), Black: 1769#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1758#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 4408#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), 6943#(and (<= |~#__global_lock~0.base| 3) (= (select (select |#pthreadsMutex| |~#__global_lock~0.base|) |~#__global_lock~0.offset|) 1) (not (= |~#a~0.base| |~#__global_lock~0.base|))), Black: 3647#(not (= |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)), Black: 4414#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 131#L929-2true, Black: 3986#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|)), Black: 4418#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 4410#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0)), 410#true, Black: 4412#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 4416#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), 3635#true, 4431#true, 232#true, 2825#true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 5212#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), 6042#true, Black: 5225#(and (= 4 (+ 4 |~#__global_lock~0.offset|)) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (= |~#a~0.base| 4)), Black: 5210#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 5223#(and (= 4 (+ 4 |~#__global_lock~0.offset|)) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (= |~#a~0.base| 4)), Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 5221#(and (= 4 (+ 4 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (= |~#a~0.base| 4)), Black: 5214#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 5206#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), 816#true]) [2022-01-19 06:15:42,029 INFO L384 tUnfolder$Statistics]: this new event has 167 ancestors and is not cut-off event [2022-01-19 06:15:42,029 INFO L387 tUnfolder$Statistics]: existing Event has 167 ancestors and is not cut-off event [2022-01-19 06:15:42,030 INFO L387 tUnfolder$Statistics]: existing Event has 167 ancestors and is not cut-off event [2022-01-19 06:15:42,030 INFO L387 tUnfolder$Statistics]: existing Event has 167 ancestors and is not cut-off event [2022-01-19 06:15:42,033 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([737] L953-6-->L953-7: Formula: (= |v_#memory_int_10| (store |v_#memory_int_11| |v_ULTIMATE.start_main_~#t_ids~0#1.base_3| (store (select |v_#memory_int_11| |v_ULTIMATE.start_main_~#t_ids~0#1.base_3|) (+ |v_ULTIMATE.start_main_~#t_ids~0#1.offset_3| (* |v_ULTIMATE.start_main_~i~3#1_5| 4)) |v_ULTIMATE.start_main_#t~pre45#1_3|))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_3|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_3|, ULTIMATE.start_main_#t~pre45#1=|v_ULTIMATE.start_main_#t~pre45#1_3|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_5|} OutVars{#memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_3|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_3|, ULTIMATE.start_main_#t~pre45#1=|v_ULTIMATE.start_main_#t~pre45#1_3|, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_5|} AuxVars[] AssignedVars[#memory_int][210], [Black: 6886#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 6916#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 6889#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 6906#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 6044#(= |~#__global_lock~0.offset| 0), Black: 6902#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 2094#(<= |ULTIMATE.start_main_~i~3#1| 2), Black: 6884#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (forall ((v_ArrVal_966 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_966) |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) (= |~#__global_lock~0.offset| 0)), Black: 6914#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 6904#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 6060#(= |t_funThread1of2ForFork0_#t~mem41#1| 0), Black: 6910#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), 1978#(and (= |~#__global_lock~0.offset| 0) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), Black: 6912#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), 177#L953-7true, Black: 6878#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= |~#__global_lock~0.offset| 0) (forall ((v_ArrVal_966 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_966) |~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) (= |~#a~0.offset| 0) (= |~#a~0.base| 4)), Black: 6014#(and (<= 1 |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread2of2ForFork0_~p~0#1.base|)) (= |~#__global_lock~0.offset| 0) (= 4 |t_funThread2of2ForFork0_~p~0#1.base|) (= |t_funThread2of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 6059#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 2015#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (not (= |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#a~0.base|)) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), Black: 6045#(and (= |~#__global_lock~0.offset| 0) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), Black: 5240#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= 4 (+ 4 |~#__global_lock~0.offset|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 6017#(and (<= 1 |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread2of2ForFork0_~p~0#1.base|)) (= |~#__global_lock~0.offset| 0) (= 4 |t_funThread2of2ForFork0_~p~0#1.base|) (= |t_funThread2of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4) (<= 1 |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1|)), Black: 1997#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#a~0.base|)) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|) (= |ULTIMATE.start_main_~i~3#1| 0)), 1316#true, Black: 6007#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread2of2ForFork0_~p~0#1.base|)) (= |~#__global_lock~0.offset| 0) (= 4 |t_funThread2of2ForFork0_~p~0#1.base|) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 6011#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread2of2ForFork0_~p~0#1.base|)) (= |~#__global_lock~0.offset| 0) (= 4 |t_funThread2of2ForFork0_~p~0#1.base|) (= |t_funThread2of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 1189#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 938#(<= |ULTIMATE.start_main_~i~1#1| 3), 121#L946true, Black: 1172#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1161#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 1999#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#a~0.base|)) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), Black: 2021#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#a~0.base|)) (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (not (= |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#a~0.base|)) (< |~#a~0.base| (+ 5 |~#__global_lock~0.offset|)) (= (select |#valid| 4) 1) (not (= |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (= |~#a~0.offset| 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#a~0.base|)), Black: 3616#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 3613#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 3194#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|)), Black: 414#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 720#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 3606#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 3601#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1332#(<= |ULTIMATE.start_main_~i~1#1| 7), Black: 1769#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1758#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 4408#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), 6943#(and (<= |~#__global_lock~0.base| 3) (= (select (select |#pthreadsMutex| |~#__global_lock~0.base|) |~#__global_lock~0.offset|) 1) (not (= |~#a~0.base| |~#__global_lock~0.base|))), Black: 3647#(not (= |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)), 131#L929-2true, Black: 4414#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 3986#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|)), Black: 4418#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 4410#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0)), 410#true, Black: 4412#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), Black: 4416#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0)), 3635#true, 232#true, 4431#true, 2825#true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 5212#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 5225#(and (= 4 (+ 4 |~#__global_lock~0.offset|)) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (= |~#a~0.base| 4)), 6042#true, Black: 5210#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 5223#(and (= 4 (+ 4 |~#__global_lock~0.offset|)) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (= |~#a~0.base| 4)), Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 5221#(and (= 4 (+ 4 |~#__global_lock~0.offset|)) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (= |~#a~0.base| 4)), Black: 5214#(and (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (<= 1 |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= |t_funThread1of2ForFork0_#t~mem41#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), Black: 5206#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |t_funThread1of2ForFork0_~p~0#1.base|)) (= 4 |t_funThread1of2ForFork0_~p~0#1.base|) (= |~#__global_lock~0.offset| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |~#a~0.base| 4)), 816#true]) [2022-01-19 06:15:42,033 INFO L384 tUnfolder$Statistics]: this new event has 171 ancestors and is not cut-off event [2022-01-19 06:15:42,033 INFO L387 tUnfolder$Statistics]: existing Event has 171 ancestors and is not cut-off event [2022-01-19 06:15:42,033 INFO L387 tUnfolder$Statistics]: existing Event has 171 ancestors and is not cut-off event [2022-01-19 06:15:42,033 INFO L387 tUnfolder$Statistics]: existing Event has 171 ancestors and is not cut-off event [2022-01-19 06:15:42,033 INFO L129 PetriNetUnfolder]: 1293/6806 cut-off events. [2022-01-19 06:15:42,033 INFO L130 PetriNetUnfolder]: For 25237/25898 co-relation queries the response was YES. [2022-01-19 06:15:42,085 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18874 conditions, 6806 events. 1293/6806 cut-off events. For 25237/25898 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 78836 event pairs, 251 based on Foata normal form. 866/7136 useless extension candidates. Maximal degree in co-relation 18807. Up to 1192 conditions per place. [2022-01-19 06:15:42,097 INFO L132 encePairwiseOnDemand]: 253/269 looper letters, 78 selfloop transitions, 57 changer transitions 62/446 dead transitions. [2022-01-19 06:15:42,097 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 446 transitions, 3819 flow [2022-01-19 06:15:42,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 06:15:42,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 06:15:42,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1121 transitions. [2022-01-19 06:15:42,099 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.69454770755886 [2022-01-19 06:15:42,099 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1121 transitions. [2022-01-19 06:15:42,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1121 transitions. [2022-01-19 06:15:42,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:15:42,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1121 transitions. [2022-01-19 06:15:42,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 186.83333333333334) internal successors, (1121), 6 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:15:42,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 269.0) internal successors, (1883), 7 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:15:42,101 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 269.0) internal successors, (1883), 7 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:15:42,102 INFO L186 Difference]: Start difference. First operand has 342 places, 470 transitions, 3932 flow. Second operand 6 states and 1121 transitions. [2022-01-19 06:15:42,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 446 transitions, 3819 flow [2022-01-19 06:15:42,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 446 transitions, 3641 flow, removed 31 selfloop flow, removed 17 redundant places. [2022-01-19 06:15:42,269 INFO L242 Difference]: Finished difference. Result has 309 places, 363 transitions, 2617 flow [2022-01-19 06:15:42,269 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=3103, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2617, PETRI_PLACES=309, PETRI_TRANSITIONS=363} [2022-01-19 06:15:42,270 INFO L334 CegarLoopForPetriNet]: 229 programPoint places, 80 predicate places. [2022-01-19 06:15:42,270 INFO L470 AbstractCegarLoop]: Abstraction has has 309 places, 363 transitions, 2617 flow [2022-01-19 06:15:42,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 180.71428571428572) internal successors, (1265), 7 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:15:42,270 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:15:42,270 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 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] [2022-01-19 06:15:42,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-19 06:15:42,271 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:15:42,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:15:42,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1714869739, now seen corresponding path program 1 times [2022-01-19 06:15:42,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:15:42,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013299775] [2022-01-19 06:15:42,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:15:42,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:15:42,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2022-01-19 06:23:03,954 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-01-19 06:23:03,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-19 06:23:03,955 WARN L594 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 151 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∧-2-2-5-3-6-13-4-12-4-12-4-12-4-12-4-12-4-12-4-12-4-11-4-11-4-11-4-11-4-11-4-11-4-10-4-10-4-10-4-10-4-10-4-9-4-9-4-9-4-9-4-8-4-8-4-8-4-7-4-7-4-6-2-4-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-5-2-4-1 context. [2022-01-19 06:23:03,955 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-01-19 06:23:03,956 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-01-19 06:23:03,957 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-01-19 06:23:03,957 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:23:03,958 INFO L309 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/2) [2022-01-19 06:23:03,959 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2022-01-19 06:23:03,961 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 06:23:03,961 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-19 06:23:03,961 WARN L594 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was constructing initial abstraction,while executing CegarLoopForPetriNet. [2022-01-19 06:23:03,961 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 1 remaining) [2022-01-19 06:23:03,961 INFO L732 BasicCegarLoop]: Path program histogram: [] [2022-01-19 06:23:03,962 INFO L309 ceAbstractionStarter]: Result for error location InUseError was TIMEOUT (2/2) [2022-01-19 06:23:03,962 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2022-01-19 06:23:03,962 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 06:23:03,964 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-19 06:23:03,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 06:23:03 BasicIcfg [2022-01-19 06:23:03,972 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 06:23:03,973 INFO L158 Benchmark]: Toolchain (without parser) took 815761.39ms. Allocated memory was 352.3MB in the beginning and 14.2GB in the end (delta: 13.9GB). Free memory was 296.6MB in the beginning and 5.6GB in the end (delta: -5.3GB). Peak memory consumption was 8.6GB. Max. memory is 16.0GB. [2022-01-19 06:23:03,973 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 352.3MB. Free memory is still 316.1MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 06:23:03,974 INFO L158 Benchmark]: CACSL2BoogieTranslator took 611.77ms. Allocated memory is still 352.3MB. Free memory was 296.4MB in the beginning and 306.3MB in the end (delta: -9.9MB). Peak memory consumption was 13.8MB. Max. memory is 16.0GB. [2022-01-19 06:23:03,974 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.10ms. Allocated memory is still 352.3MB. Free memory was 306.3MB in the beginning and 303.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2022-01-19 06:23:03,974 INFO L158 Benchmark]: Boogie Preprocessor took 41.12ms. Allocated memory is still 352.3MB. Free memory was 303.1MB in the beginning and 301.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 06:23:03,974 INFO L158 Benchmark]: RCFGBuilder took 425.02ms. Allocated memory is still 352.3MB. Free memory was 301.0MB in the beginning and 283.2MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2022-01-19 06:23:03,975 INFO L158 Benchmark]: TraceAbstraction took 814620.69ms. Allocated memory was 352.3MB in the beginning and 14.2GB in the end (delta: 13.9GB). Free memory was 283.2MB in the beginning and 5.6GB in the end (delta: -5.3GB). Peak memory consumption was 8.6GB. Max. memory is 16.0GB. [2022-01-19 06:23:03,976 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 352.3MB. Free memory is still 316.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 611.77ms. Allocated memory is still 352.3MB. Free memory was 296.4MB in the beginning and 306.3MB in the end (delta: -9.9MB). Peak memory consumption was 13.8MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 57.10ms. Allocated memory is still 352.3MB. Free memory was 306.3MB in the beginning and 303.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 41.12ms. Allocated memory is still 352.3MB. Free memory was 303.1MB in the beginning and 301.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 425.02ms. Allocated memory is still 352.3MB. Free memory was 301.0MB in the beginning and 283.2MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 814620.69ms. Allocated memory was 352.3MB in the beginning and 14.2GB in the end (delta: 13.9GB). Free memory was 283.2MB in the beginning and 5.6GB in the end (delta: -5.3GB). Peak memory consumption was 8.6GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 151 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∧-2-2-5-3-6-13-4-12-4-12-4-12-4-12-4-12-4-12-4-12-4-11-4-11-4-11-4-11-4-11-4-11-4-10-4-10-4-10-4-10-4-10-4-9-4-9-4-9-4-9-4-8-4-8-4-8-4-7-4-7-4-6-2-4-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-5-2-4-1 context. - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 151 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∧-2-2-5-3-6-13-4-12-4-12-4-12-4-12-4-12-4-12-4-12-4-11-4-11-4-11-4-11-4-11-4-11-4-10-4-10-4-10-4-10-4-10-4-9-4-9-4-9-4-9-4-8-4-8-4-8-4-7-4-7-4-6-2-4-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-5-2-4-1 context. - TimeoutResultAtElement [Line: 953]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was constructing initial abstraction,while executing CegarLoopForPetriNet. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 225 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 98.3s, OverallIterations: 9, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 90.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 248 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 248 mSDsluCounter, 406 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 118 IncrementalHoareTripleChecker+Unchecked, 372 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 714 IncrementalHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 57 mSDtfsCounter, 714 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1166 GetRequests, 984 SyntacticMatches, 10 SemanticMatches, 172 ConstructedPredicates, 4 IntricatePredicates, 2 DeprecatedPredicates, 1248 ImplicationChecksByTransitivity, 89.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=476occurred in iteration=8, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 1301 NumberOfCodeBlocks, 1301 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1769 ConstructedInterpolants, 200 QuantifiedInterpolants, 13275 SizeOfPredicates, 42 NumberOfNonLiveVariables, 1215 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 20 InterpolantComputations, 4 PerfectInterpolantSequences, 1669/2070 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 283 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 713.4s, OverallIterations: 15, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 257.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3047 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3047 mSDsluCounter, 2842 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1351 IncrementalHoareTripleChecker+Unchecked, 2939 mSDsCounter, 248 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5296 IncrementalHoareTripleChecker+Invalid, 6895 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 248 mSolverCounterUnsat, 276 mSDtfsCounter, 5296 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2338 GetRequests, 1958 SyntacticMatches, 26 SemanticMatches, 354 ConstructedPredicates, 9 IntricatePredicates, 6 DeprecatedPredicates, 3786 ImplicationChecksByTransitivity, 236.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3932occurred in iteration=13, InterpolantAutomatonStates: 235, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.8s InterpolantComputationTime, 2456 NumberOfCodeBlocks, 2456 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3415 ConstructedInterpolants, 502 QuantifiedInterpolants, 32365 SizeOfPredicates, 76 NumberOfNonLiveVariables, 2322 ConjunctsInSsa, 121 ConjunctsInUnsatCore, 33 InterpolantComputations, 5 PerfectInterpolantSequences, 4750/5250 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 3 procedures, 225 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.7s, OverallIterations: 6, TraceHistogramMax: 10, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 104 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 104 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 199 IncrementalHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 16 mSDtfsCounter, 199 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 474 GetRequests, 393 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=641occurred in iteration=5, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 610 NumberOfCodeBlocks, 610 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 704 ConstructedInterpolants, 0 QuantifiedInterpolants, 1054 SizeOfPredicates, 22 NumberOfNonLiveVariables, 458 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 55/448 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 2 thread instances CFG has 4 procedures, 283 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown