/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-word-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 18:49:10,856 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 18:49:10,858 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 18:49:10,889 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 18:49:10,889 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 18:49:10,890 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 18:49:10,900 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 18:49:10,902 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 18:49:10,923 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 18:49:10,924 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 18:49:10,925 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 18:49:10,926 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 18:49:10,926 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 18:49:10,927 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 18:49:10,927 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 18:49:10,928 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 18:49:10,929 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 18:49:10,929 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 18:49:10,930 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 18:49:10,931 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 18:49:10,932 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 18:49:10,933 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 18:49:10,934 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 18:49:10,934 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 18:49:10,939 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 18:49:10,939 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 18:49:10,940 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 18:49:10,940 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 18:49:10,940 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 18:49:10,941 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 18:49:10,941 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 18:49:10,941 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 18:49:10,942 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 18:49:10,942 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 18:49:10,943 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 18:49:10,943 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 18:49:10,943 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 18:49:10,944 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 18:49:10,944 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 18:49:10,944 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 18:49:10,945 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 18:49:10,948 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 18:49:10,970 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 18:49:10,971 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 18:49:10,971 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 18:49:10,971 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 18:49:10,972 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 18:49:10,972 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 18:49:10,972 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 18:49:10,972 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 18:49:10,972 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 18:49:10,972 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 18:49:10,972 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 18:49:10,972 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 18:49:10,972 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 18:49:10,972 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 18:49:10,972 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 18:49:10,973 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 18:49:10,973 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 18:49:10,973 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 18:49:10,973 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 18:49:10,973 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 18:49:10,973 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 18:49:10,973 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 18:49:10,973 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 18:49:10,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 18:49:10,973 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 18:49:10,973 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 18:49:10,974 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 18:49:10,974 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 18:49:10,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 18:49:10,974 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 18:49:10,974 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 18:49:10,974 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 18:49:10,974 INFO L138 SettingsManager]: * Interpolant automaton=MCR 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-03-15 18:49:11,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 18:49:11,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 18:49:11,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 18:49:11,173 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 18:49:11,175 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 18:49:11,176 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-word-subst.wvr.c [2022-03-15 18:49:11,216 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da9c48090/854816c3adf14ceeb904ec2138ff9eaa/FLAG1ccdc40ba [2022-03-15 18:49:11,540 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 18:49:11,540 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-word-subst.wvr.c [2022-03-15 18:49:11,546 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da9c48090/854816c3adf14ceeb904ec2138ff9eaa/FLAG1ccdc40ba [2022-03-15 18:49:11,954 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da9c48090/854816c3adf14ceeb904ec2138ff9eaa [2022-03-15 18:49:11,956 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 18:49:11,957 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 18:49:11,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 18:49:11,958 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 18:49:11,960 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 18:49:11,960 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 06:49:11" (1/1) ... [2022-03-15 18:49:11,961 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b957c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:49:11, skipping insertion in model container [2022-03-15 18:49:11,961 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 06:49:11" (1/1) ... [2022-03-15 18:49:11,965 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 18:49:11,984 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 18:49:12,124 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-word-subst.wvr.c[3345,3358] [2022-03-15 18:49:12,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 18:49:12,133 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 18:49:12,149 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-word-subst.wvr.c[3345,3358] [2022-03-15 18:49:12,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 18:49:12,160 INFO L208 MainTranslator]: Completed translation [2022-03-15 18:49:12,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:49:12 WrapperNode [2022-03-15 18:49:12,161 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 18:49:12,161 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 18:49:12,162 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 18:49:12,162 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 18:49:12,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:49:12" (1/1) ... [2022-03-15 18:49:12,176 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:49:12" (1/1) ... [2022-03-15 18:49:12,196 INFO L137 Inliner]: procedures = 25, calls = 45, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 176 [2022-03-15 18:49:12,197 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 18:49:12,197 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 18:49:12,197 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 18:49:12,197 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 18:49:12,202 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:49:12" (1/1) ... [2022-03-15 18:49:12,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:49:12" (1/1) ... [2022-03-15 18:49:12,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:49:12" (1/1) ... [2022-03-15 18:49:12,205 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:49:12" (1/1) ... [2022-03-15 18:49:12,211 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:49:12" (1/1) ... [2022-03-15 18:49:12,214 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:49:12" (1/1) ... [2022-03-15 18:49:12,216 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:49:12" (1/1) ... [2022-03-15 18:49:12,218 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 18:49:12,218 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 18:49:12,219 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 18:49:12,219 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 18:49:12,219 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:49:12" (1/1) ... [2022-03-15 18:49:12,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 18:49:12,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:49:12,252 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-03-15 18:49:12,259 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-03-15 18:49:12,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 18:49:12,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 18:49:12,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 18:49:12,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 18:49:12,275 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 18:49:12,275 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 18:49:12,275 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 18:49:12,275 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 18:49:12,275 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 18:49:12,275 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 18:49:12,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 18:49:12,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 18:49:12,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 18:49:12,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 18:49:12,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 18:49:12,277 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 18:49:12,416 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 18:49:12,417 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 18:49:12,770 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 18:49:12,779 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 18:49:12,780 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-03-15 18:49:12,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 06:49:12 BoogieIcfgContainer [2022-03-15 18:49:12,781 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 18:49:12,782 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 18:49:12,782 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 18:49:12,785 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 18:49:12,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 06:49:11" (1/3) ... [2022-03-15 18:49:12,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e70562f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 06:49:12, skipping insertion in model container [2022-03-15 18:49:12,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:49:12" (2/3) ... [2022-03-15 18:49:12,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e70562f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 06:49:12, skipping insertion in model container [2022-03-15 18:49:12,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 06:49:12" (3/3) ... [2022-03-15 18:49:12,786 INFO L111 eAbstractionObserver]: Analyzing ICFG chl-word-subst.wvr.c [2022-03-15 18:49:12,789 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 18:49:12,790 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 18:49:12,790 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 18:49:12,790 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 18:49:12,828 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~stop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,828 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~stop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,828 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,828 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,829 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,829 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,829 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,829 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,830 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,830 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,830 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,830 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,830 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~stop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,830 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~stop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,830 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~stop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,831 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~stop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,831 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,831 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,831 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,831 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,831 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,832 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,832 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,832 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,832 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,832 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,832 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,832 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,832 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,833 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,833 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,833 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,833 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,833 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,833 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,833 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,833 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,834 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,834 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,834 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,834 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,834 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,834 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,834 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,834 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,834 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,834 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,835 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,835 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,835 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,835 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,835 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,835 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,835 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,835 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,836 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,836 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,836 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,836 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,836 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,836 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,836 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,836 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,837 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,837 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,837 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,837 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,837 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,837 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,837 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,837 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,838 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,838 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,838 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,838 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,838 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,838 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,838 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,838 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,838 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,839 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,839 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,839 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,839 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,839 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,839 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,839 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~stop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,839 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~stop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,840 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~stop~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,840 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~stop~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,840 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,840 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,841 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,841 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,841 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,841 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,841 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,842 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,842 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,842 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,842 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~stop~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,842 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~stop~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,842 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~stop~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,842 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~stop~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,843 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,843 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,843 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,843 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,843 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,843 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,844 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,844 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,844 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,844 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,844 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,844 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,844 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,844 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,845 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,845 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,845 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,845 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,845 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,845 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,845 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,845 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,846 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,846 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,846 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,846 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,846 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,846 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,846 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,846 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,846 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,846 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,847 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,847 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,847 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,847 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,847 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,847 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,847 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,847 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,848 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,848 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,848 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,848 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,848 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,848 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,848 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,848 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,849 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,849 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,849 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,849 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,849 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,849 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,849 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,849 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,850 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,850 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,850 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,850 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,850 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,850 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,850 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,850 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,851 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,851 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,851 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,851 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,851 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,851 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,851 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~stop~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,851 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~stop~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,852 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~stop~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,852 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~stop~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,852 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,852 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,852 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,853 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,853 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,853 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,853 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,853 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,854 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,854 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,854 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~stop~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,854 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~stop~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,854 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~stop~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,854 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~stop~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,854 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,854 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,855 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,855 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,855 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,855 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,855 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,855 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,856 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,856 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,856 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,856 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,856 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,856 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,856 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,856 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,857 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,857 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,857 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,857 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,857 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,857 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,857 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,857 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,857 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,857 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,858 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,858 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,858 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,858 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,858 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,858 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,858 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,858 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,858 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,859 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,859 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,859 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,859 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,859 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,859 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,859 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,859 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,860 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,860 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,860 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,860 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,860 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,860 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,860 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,860 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,861 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,861 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,861 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,861 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,861 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,861 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,861 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,861 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,862 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,862 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,862 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,862 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,862 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,862 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,862 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,862 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,862 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,863 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,863 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,863 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~stop~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,863 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~stop~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,865 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,865 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,865 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,866 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,866 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,866 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~stop~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,866 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,866 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,866 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,866 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,866 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,868 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,868 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,868 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,868 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,868 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,868 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,868 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,868 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,869 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,869 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~stop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,869 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,870 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,870 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,870 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,870 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,870 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~stop~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,870 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,870 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,871 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,871 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,871 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,871 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:12,875 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 18:49:12,901 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 18:49:12,907 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, 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=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 18:49:12,908 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 18:49:12,920 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 18:49:12,926 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 315 places, 340 transitions, 704 flow [2022-03-15 18:49:12,927 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 315 places, 340 transitions, 704 flow [2022-03-15 18:49:12,928 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 315 places, 340 transitions, 704 flow [2022-03-15 18:49:13,062 INFO L129 PetriNetUnfolder]: 35/337 cut-off events. [2022-03-15 18:49:13,062 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 18:49:13,070 INFO L84 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 337 events. 35/337 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 507 event pairs, 0 based on Foata normal form. 0/301 useless extension candidates. Maximal degree in co-relation 261. Up to 3 conditions per place. [2022-03-15 18:49:13,077 INFO L116 LiptonReduction]: Number of co-enabled transitions 12480 [2022-03-15 18:49:21,121 INFO L131 LiptonReduction]: Checked pairs total: 14919 [2022-03-15 18:49:21,122 INFO L133 LiptonReduction]: Total number of compositions: 371 [2022-03-15 18:49:21,129 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 43 transitions, 110 flow [2022-03-15 18:49:21,175 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 349 states, 348 states have (on average 4.080459770114943) internal successors, (1420), 348 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:21,178 INFO L276 IsEmpty]: Start isEmpty. Operand has 349 states, 348 states have (on average 4.080459770114943) internal successors, (1420), 348 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:21,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 18:49:21,187 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:49:21,188 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:49:21,188 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:49:21,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:49:21,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1912147289, now seen corresponding path program 1 times [2022-03-15 18:49:21,204 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:49:21,205 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051544037] [2022-03-15 18:49:21,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:49:21,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:49:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:49:21,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:49:21,454 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:49:21,454 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051544037] [2022-03-15 18:49:21,455 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051544037] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:49:21,455 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:49:21,455 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 18:49:21,456 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [206482126] [2022-03-15 18:49:21,456 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:49:21,461 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:49:21,477 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 83 transitions. [2022-03-15 18:49:21,477 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:49:21,923 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 18:49:21,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 18:49:21,925 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:49:21,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 18:49:21,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 18:49:21,942 INFO L87 Difference]: Start difference. First operand has 349 states, 348 states have (on average 4.080459770114943) internal successors, (1420), 348 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:22,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:49:22,034 INFO L93 Difference]: Finished difference Result 442 states and 1711 transitions. [2022-03-15 18:49:22,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 18:49:22,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 18:49:22,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:49:22,051 INFO L225 Difference]: With dead ends: 442 [2022-03-15 18:49:22,051 INFO L226 Difference]: Without dead ends: 249 [2022-03-15 18:49:22,052 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 18:49:22,055 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 10 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:49:22,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 3 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 18:49:22,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-03-15 18:49:22,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2022-03-15 18:49:22,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 3.7580645161290325) internal successors, (932), 248 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:22,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 932 transitions. [2022-03-15 18:49:22,106 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 932 transitions. Word has length 19 [2022-03-15 18:49:22,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:49:22,107 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 932 transitions. [2022-03-15 18:49:22,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:22,107 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 932 transitions. [2022-03-15 18:49:22,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 18:49:22,113 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:49:22,113 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:49:22,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 18:49:22,113 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:49:22,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:49:22,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1604939885, now seen corresponding path program 1 times [2022-03-15 18:49:22,115 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:49:22,118 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15842847] [2022-03-15 18:49:22,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:49:22,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:49:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:49:22,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:49:22,303 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:49:22,304 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15842847] [2022-03-15 18:49:22,304 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15842847] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:49:22,304 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:49:22,304 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 18:49:22,305 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1213559951] [2022-03-15 18:49:22,305 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:49:22,307 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:49:22,317 INFO L252 McrAutomatonBuilder]: Finished intersection with 61 states and 117 transitions. [2022-03-15 18:49:22,317 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:49:23,996 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [1966#(and (or (<= ~count2~0 ~count3~0) (<= 1 ~res2~0) (not (= ~count2~0 ~count1~0))) (or (= ~count3~0 ~count2~0) (< ~count3~0 ~count2~0) (< ~res2~0 0) (not (= ~count2~0 ~count1~0)))), 1968#(and (or (= ~count3~0 ~count1~0) (= (+ ~res3~0 1) 0) (< ~count3~0 ~count1~0)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), 1970#(and (or (<= ~count1~0 ~count3~0) (= ~count3~0 ~count2~0) (< ~count3~0 ~count2~0)) (or (= ~count3~0 ~count1~0) (not (< ~count3~0 ~count2~0)) (< ~count3~0 ~count1~0))), 1967#(and (or (<= ~count2~0 ~count3~0) (<= 1 ~res2~0) (not (= ~count2~0 ~count1~0))) (or (<= (+ ~res2~0 1) 0) (not (= ~count2~0 ~count1~0)) (<= (+ ~count3~0 1) ~count2~0))), 1969#(and (or (<= ~count1~0 ~count3~0) (= ~res3~0 1) (not (= ~count2~0 ~count1~0))) (or (= ~count3~0 ~count1~0) (= (+ ~res3~0 1) 0) (< ~count3~0 ~count1~0) (not (= ~count2~0 ~count1~0)))), 1964#(and (or (< ~res2~0 0) (= ~res3~0 1) (not (= ~count2~0 ~count1~0))) (or (= (+ ~res3~0 1) 0) (<= 1 ~res2~0) (not (= ~count2~0 ~count1~0)))), 1965#(and (or (<= ~count2~0 ~count3~0) (<= 1 ~res2~0)) (or (= ~count3~0 ~count2~0) (< ~count3~0 ~count2~0) (< ~res2~0 0))), 1971#(and (or (<= ~count1~0 ~count3~0) (<= (+ ~count3~0 1) ~count2~0)) (or (= ~count3~0 ~count1~0) (not (< ~count3~0 ~count2~0)) (< ~count3~0 ~count1~0)))] [2022-03-15 18:49:23,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 18:49:23,997 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:49:23,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 18:49:23,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-03-15 18:49:23,997 INFO L87 Difference]: Start difference. First operand 249 states and 932 transitions. Second operand has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 13 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:24,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:49:24,943 INFO L93 Difference]: Finished difference Result 458 states and 1469 transitions. [2022-03-15 18:49:24,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 18:49:24,943 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 13 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 18:49:24,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:49:24,946 INFO L225 Difference]: With dead ends: 458 [2022-03-15 18:49:24,946 INFO L226 Difference]: Without dead ends: 445 [2022-03-15 18:49:24,946 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 43 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=226, Invalid=644, Unknown=0, NotChecked=0, Total=870 [2022-03-15 18:49:24,947 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 264 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 18:49:24,947 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 21 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 18:49:24,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2022-03-15 18:49:24,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 279. [2022-03-15 18:49:24,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 278 states have (on average 3.597122302158273) internal successors, (1000), 278 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:24,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 1000 transitions. [2022-03-15 18:49:24,966 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 1000 transitions. Word has length 20 [2022-03-15 18:49:24,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:49:24,966 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 1000 transitions. [2022-03-15 18:49:24,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 13 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:24,967 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 1000 transitions. [2022-03-15 18:49:24,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 18:49:24,968 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:49:24,968 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:49:24,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 18:49:24,968 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:49:24,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:49:24,968 INFO L85 PathProgramCache]: Analyzing trace with hash 396249682, now seen corresponding path program 1 times [2022-03-15 18:49:24,969 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:49:24,970 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034115618] [2022-03-15 18:49:24,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:49:24,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:49:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:49:25,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:49:25,049 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:49:25,050 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034115618] [2022-03-15 18:49:25,050 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034115618] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:49:25,050 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:49:25,050 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 18:49:25,050 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2135523864] [2022-03-15 18:49:25,050 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:49:25,056 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:49:25,071 INFO L252 McrAutomatonBuilder]: Finished intersection with 79 states and 163 transitions. [2022-03-15 18:49:25,072 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:49:25,732 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [3044#(or (not (= ~count3~0 ~count2~0)) (not (= ~count2~0 ~count1~0))), 3045#(= ~count3~0 ~count1~0), 3046#(or (= ~count3~0 ~count1~0) (not (= ~count2~0 ~count1~0))), 3047#(or (= ~count3~0 ~count1~0) (not (= ~count3~0 ~count2~0))), 3043#(not (= ~count2~0 ~count1~0))] [2022-03-15 18:49:25,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 18:49:25,732 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:49:25,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 18:49:25,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-03-15 18:49:25,734 INFO L87 Difference]: Start difference. First operand 279 states and 1000 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:25,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:49:25,921 INFO L93 Difference]: Finished difference Result 337 states and 1104 transitions. [2022-03-15 18:49:25,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 18:49:25,921 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 18:49:25,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:49:25,923 INFO L225 Difference]: With dead ends: 337 [2022-03-15 18:49:25,923 INFO L226 Difference]: Without dead ends: 303 [2022-03-15 18:49:25,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-03-15 18:49:25,924 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 87 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:49:25,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 3 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:49:25,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-03-15 18:49:25,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 251. [2022-03-15 18:49:25,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 3.548) internal successors, (887), 250 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:25,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 887 transitions. [2022-03-15 18:49:25,932 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 887 transitions. Word has length 21 [2022-03-15 18:49:25,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:49:25,932 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 887 transitions. [2022-03-15 18:49:25,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:25,932 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 887 transitions. [2022-03-15 18:49:25,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 18:49:25,933 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:49:25,933 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:49:25,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 18:49:25,933 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:49:25,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:49:25,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1523639138, now seen corresponding path program 1 times [2022-03-15 18:49:25,937 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:49:25,937 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340037980] [2022-03-15 18:49:25,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:49:25,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:49:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:49:26,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:49:26,005 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:49:26,005 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340037980] [2022-03-15 18:49:26,006 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340037980] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:49:26,007 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:49:26,008 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 18:49:26,008 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [634793076] [2022-03-15 18:49:26,008 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:49:26,011 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:49:26,022 INFO L252 McrAutomatonBuilder]: Finished intersection with 83 states and 175 transitions. [2022-03-15 18:49:26,023 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:49:26,820 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [3900#(and (or (<= ~count2~0 ~count3~0) (not (= ~count3~0 ~count1~0))) (or (<= ~count3~0 ~count2~0) (not (= ~count3~0 ~count1~0)))), 3897#(not (= ~count2~0 ~count1~0)), 3901#(or (not (= ~count3~0 ~count1~0)) (not (= ~count2~0 ~count1~0))), 3899#(not (= ~count3~0 ~count1~0)), 3898#(and (or (<= ~count3~0 ~count2~0) (not (= ~count2~0 ~count1~0))) (or (<= ~count2~0 ~count3~0) (not (= ~count2~0 ~count1~0))))] [2022-03-15 18:49:26,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 18:49:26,821 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:49:26,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 18:49:26,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-03-15 18:49:26,821 INFO L87 Difference]: Start difference. First operand 251 states and 887 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:26,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:49:26,993 INFO L93 Difference]: Finished difference Result 279 states and 930 transitions. [2022-03-15 18:49:26,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 18:49:26,994 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 18:49:26,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:49:26,995 INFO L225 Difference]: With dead ends: 279 [2022-03-15 18:49:26,995 INFO L226 Difference]: Without dead ends: 269 [2022-03-15 18:49:26,995 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 47 SyntacticMatches, 13 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-03-15 18:49:26,996 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 68 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:49:26,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 9 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:49:26,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-03-15 18:49:27,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 249. [2022-03-15 18:49:27,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 3.3548387096774195) internal successors, (832), 248 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:27,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 832 transitions. [2022-03-15 18:49:27,002 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 832 transitions. Word has length 21 [2022-03-15 18:49:27,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:49:27,002 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 832 transitions. [2022-03-15 18:49:27,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:27,003 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 832 transitions. [2022-03-15 18:49:27,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:49:27,003 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:49:27,003 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:49:27,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 18:49:27,003 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:49:27,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:49:27,004 INFO L85 PathProgramCache]: Analyzing trace with hash -2100419519, now seen corresponding path program 1 times [2022-03-15 18:49:27,004 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:49:27,005 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366728521] [2022-03-15 18:49:27,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:49:27,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:49:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:49:27,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:49:27,299 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:49:27,299 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366728521] [2022-03-15 18:49:27,300 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366728521] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:49:27,300 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:49:27,300 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-15 18:49:27,300 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [865583035] [2022-03-15 18:49:27,300 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:49:27,302 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:49:27,323 INFO L252 McrAutomatonBuilder]: Finished intersection with 109 states and 246 transitions. [2022-03-15 18:49:27,323 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:49:28,414 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:28,527 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:28,647 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:28,708 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:29,166 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:29,202 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:30,648 INFO L353 Elim1Store]: treesize reduction 12, result has 36.8 percent of original size [2022-03-15 18:49:30,649 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 39 treesize of output 14 [2022-03-15 18:49:30,689 INFO L353 Elim1Store]: treesize reduction 12, result has 36.8 percent of original size [2022-03-15 18:49:30,690 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 11 [2022-03-15 18:49:30,753 INFO L353 Elim1Store]: treesize reduction 12, result has 36.8 percent of original size [2022-03-15 18:49:30,753 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 11 [2022-03-15 18:49:30,785 INFO L353 Elim1Store]: treesize reduction 12, result has 36.8 percent of original size [2022-03-15 18:49:30,785 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 39 treesize of output 14 [2022-03-15 18:49:30,885 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:31,744 INFO L353 Elim1Store]: treesize reduction 12, result has 36.8 percent of original size [2022-03-15 18:49:31,744 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 39 treesize of output 14 [2022-03-15 18:49:31,783 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:31,819 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:31,923 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:32,590 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:32,612 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:32,648 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:32,721 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:33,716 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:33,743 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:33,780 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:33,872 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:37,343 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:37,486 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:37,697 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:37,709 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:37,824 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:37,831 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:37,845 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:37,905 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:39,166 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:39,197 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:39,230 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:39,301 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:43,746 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:43,872 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:44,032 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:44,043 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:44,134 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:44,141 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:44,155 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:44,204 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:44,585 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:44,601 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:44,606 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:44,684 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:46,819 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [4702#(and (or (<= 0 ~res2~0) (<= (+ ~n1~0 1) ~n2~0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0))) (or (<= 0 ~res2~0) (<= (+ ~res1~0 1) 0) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= ~n1~0 ~n3~0) (<= (+ ~n1~0 1) ~n2~0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0))) (or (<= (+ ~res1~0 1) 0) (<= ~n2~0 0) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= (+ ~res1~0 ~n2~0) ~n3~0) (<= (+ ~res1~0 1) 0) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= (+ ~n1~0 1) ~n2~0) (<= ~n2~0 0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0))) (or (<= (+ ~n1~0 1) ~n2~0) (<= ~res2~0 0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0))) (or (<= (+ ~n1~0 1) ~n2~0) (<= ~n3~0 ~n1~0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0))) (or (<= (+ ~res1~0 1) 0) (<= ~n3~0 (+ ~res1~0 ~n2~0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= (+ ~res1~0 1) 0) (<= ~res2~0 0) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0))), 4706#(and (or (<= ~n1~0 ~n3~0) (<= (+ ~n1~0 1) ~n2~0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0))) (or (<= (+ ~res1~0 1) 0) (<= ~n2~0 0) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= (+ ~res1~0 ~n2~0) ~n3~0) (<= (+ ~res1~0 1) 0) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= (+ ~n1~0 1) ~n2~0) (<= ~n2~0 0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0))) (or (<= (+ ~n1~0 1) ~n2~0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (= ~res2~0 0)) (or (<= (+ ~n1~0 1) ~n2~0) (<= ~n3~0 ~n1~0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0))) (or (<= (+ ~res1~0 1) 0) (= ~res2~0 0) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= ~n1~0 ~n3~0) (<= (+ ~res1~0 1) 0) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= (+ ~res1~0 1) 0) (<= ~n3~0 ~n1~0) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= (+ ~res1~0 1) 0) (<= ~n3~0 (+ ~res1~0 ~n2~0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0))), 4701#(and (or (= thread3Thread1of1ForFork0_~stop~2 0) (<= (+ ~res1~0 1) 0)) (or (<= ~n2~0 thread3Thread1of1ForFork0_~i~2) (<= (+ ~res1~0 1) 0)) (or (<= ~n1~0 ~n3~0) (<= (+ ~res1~0 1) 0)) (or (<= (+ ~res1~0 1) 0) (<= ~n3~0 ~n1~0)) (or (<= 0 ~res2~0) (<= (+ ~res1~0 1) 0)) (or (<= (+ ~res1~0 1) 0) (<= ~res2~0 0)) (or (<= (+ ~res1~0 ~n2~0) ~n3~0) (<= (+ ~res1~0 1) 0)) (or (<= (+ ~res1~0 1) 0) (= thread3Thread1of1ForFork0_~i~2 0)) (or (<= (+ ~res1~0 1) 0) (<= ~n3~0 (+ ~res1~0 ~n2~0)))), 4705#(and (or (< 0 ~res3~0) (<= (+ ~n1~0 1) ~n2~0) (<= ~res2~0 0) (< ~res3~0 0)) (or (<= ~res3~0 0) (< 0 ~res2~0) (<= (+ ~n1~0 1) ~n2~0)) (or (< 0 ~res3~0) (<= ~n1~0 ~n3~0) (<= (+ ~n1~0 1) ~n2~0) (< ~res3~0 0)) (or (<= ~res3~0 0) (<= (+ ~n1~0 1) ~n2~0) (< ~n3~0 ~n1~0)) (or (<= 0 ~res2~0) (<= (+ ~n1~0 1) ~n2~0)) (or (<= (+ ~n1~0 1) ~n2~0) (<= ~n2~0 (+ ~res3~0 ~n1~0))) (or (<= (+ ~n1~0 1) ~n2~0) (<= ~n3~0 ~n1~0))), 4700#(and (or (<= (+ ~res1~0 1) 0) (<= 0 (+ ~res3~0 ~res1~0))) (or (<= (+ ~res1~0 1) 0) (<= ~n3~0 ~n1~0)) (or (<= ~res3~0 0) (<= (+ ~res1~0 1) 0) (< ~n3~0 ~n1~0)) (or (< 0 ~res3~0) (<= (+ ~res1~0 1) 0) (<= ~res2~0 0) (< ~res3~0 0)) (or (<= 0 ~res2~0) (<= (+ ~res1~0 1) 0)) (or (<= ~res3~0 0) (< 0 ~res2~0) (<= (+ ~res1~0 1) 0)) (or (< 0 ~res3~0) (<= ~n1~0 ~n3~0) (<= (+ ~res1~0 1) 0) (< ~res3~0 0))), 4699#(and (or (<= (+ ~n1~0 1) ~n2~0) (= thread3Thread1of1ForFork0_~i~2 0)) (or (= thread3Thread1of1ForFork0_~stop~2 0) (<= (+ ~n1~0 1) ~n2~0)) (or (<= (+ ~n1~0 1) ~n2~0) (<= ~n2~0 0)) (or (<= (+ ~n1~0 1) ~n2~0) (<= ~res2~0 0)) (or (<= 0 ~res2~0) (<= (+ ~n1~0 1) ~n2~0)) (or (<= ~n1~0 ~n3~0) (<= (+ ~n1~0 1) ~n2~0)) (or (<= (+ ~n1~0 1) ~n2~0) (<= ~n3~0 ~n1~0))), 4697#(and (or (< 0 ~res3~0) (<= (+ ~n1~0 1) ~n2~0) (<= ~res2~0 0) (< ~res3~0 0)) (or (<= ~res3~0 0) (< 0 ~res2~0) (<= (+ ~n1~0 1) ~n2~0)) (or (<= 0 ~res2~0) (<= (+ ~n1~0 1) ~n2~0)) (or (<= (+ ~n1~0 1) ~n2~0) (<= ~n2~0 (+ ~res3~0 ~n1~0)))), 4696#(and (or (<= 0 ~res2~0) (<= (+ ~n1~0 1) ~n2~0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0))) (or (<= 0 ~res2~0) (<= (+ ~res1~0 1) 0) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= (+ ~n1~0 1) ~n2~0) (<= ~res2~0 0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (not (<= 0 ~res3~0)) (not (<= ~res3~0 0))) (or (<= ~res3~0 0) (< 0 ~res2~0) (<= (+ ~res1~0 1) 0) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= (+ ~res1~0 1) 0) (<= 0 (+ ~res3~0 ~res1~0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= ~res3~0 0) (< 0 ~res2~0) (<= (+ ~n1~0 1) ~n2~0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0))) (or (<= (+ ~res1~0 1) 0) (<= ~res2~0 0) (not (<= 0 ~res3~0)) (not (<= ~res3~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= (+ ~n1~0 1) ~n2~0) (<= ~n2~0 (+ ~res3~0 ~n1~0)) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)))), 4698#(and (or (<= 0 ~res2~0) (<= (+ ~n1~0 1) ~n2~0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0))) (or (<= 0 ~res2~0) (<= (+ ~res1~0 1) 0) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (= thread3Thread1of1ForFork0_~stop~2 0) (<= (+ ~n1~0 1) ~n2~0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0))) (or (<= ~n1~0 ~n3~0) (<= (+ ~n1~0 1) ~n2~0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0))) (or (<= (+ ~res1~0 1) 0) (<= ~n2~0 0) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= (+ ~res1~0 ~n2~0) ~n3~0) (<= (+ ~res1~0 1) 0) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= (+ ~n1~0 1) ~n2~0) (<= ~n2~0 0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0))) (or (<= (+ ~n1~0 1) ~n2~0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (= thread3Thread1of1ForFork0_~i~2 0)) (or (= thread3Thread1of1ForFork0_~stop~2 0) (<= (+ ~res1~0 1) 0) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= (+ ~n1~0 1) ~n2~0) (<= ~res2~0 0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0))) (or (<= (+ ~n1~0 1) ~n2~0) (<= ~n3~0 ~n1~0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0))) (or (<= (+ ~res1~0 1) 0) (= thread3Thread1of1ForFork0_~i~2 0) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= (+ ~res1~0 1) 0) (<= ~n3~0 (+ ~res1~0 ~n2~0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= (+ ~res1~0 1) 0) (<= ~res2~0 0) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0))), 4703#(and (or (<= 0 ~res2~0) (<= (+ ~n1~0 1) ~n2~0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0))) (or (< 0 ~res3~0) (<= (+ ~res1~0 1) 0) (<= ~res2~0 0) (< ~res3~0 0) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= ~res3~0 0) (<= (+ ~res1~0 1) 0) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0) (< ~n3~0 ~n1~0)) (or (<= 0 ~res2~0) (<= (+ ~res1~0 1) 0) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (< 0 ~res3~0) (<= (+ ~n1~0 1) ~n2~0) (<= ~res2~0 0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (< ~res3~0 0)) (or (< 0 ~res3~0) (<= ~n1~0 ~n3~0) (<= (+ ~n1~0 1) ~n2~0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (< ~res3~0 0)) (or (<= ~res3~0 0) (< 0 ~res2~0) (<= (+ ~res1~0 1) 0) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= ~res3~0 0) (<= (+ ~n1~0 1) ~n2~0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (< ~n3~0 ~n1~0)) (or (<= (+ ~res1~0 1) 0) (<= 0 (+ ~res3~0 ~res1~0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= (+ ~n1~0 1) ~n2~0) (<= ~n3~0 ~n1~0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0))) (or (< 0 ~res3~0) (<= ~n1~0 ~n3~0) (<= (+ ~res1~0 1) 0) (< ~res3~0 0) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= (+ ~res1~0 1) 0) (<= ~n3~0 ~n1~0) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= ~res3~0 0) (< 0 ~res2~0) (<= (+ ~n1~0 1) ~n2~0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0))) (or (<= (+ ~n1~0 1) ~n2~0) (<= ~n2~0 (+ ~res3~0 ~n1~0)) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)))), 4704#(and (or (<= 0 ~res2~0) (<= (+ ~n1~0 1) ~n2~0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0))) (or (<= 0 ~res2~0) (<= (+ ~res1~0 1) 0) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (= thread3Thread1of1ForFork0_~stop~2 0) (<= (+ ~n1~0 1) ~n2~0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0))) (or (<= ~n1~0 ~n3~0) (<= (+ ~n1~0 1) ~n2~0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0))) (or (<= (+ ~res1~0 ~n2~0) ~n3~0) (<= (+ ~res1~0 1) 0) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= (+ ~n1~0 1) ~n2~0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (= thread3Thread1of1ForFork0_~i~2 0)) (or (= thread3Thread1of1ForFork0_~stop~2 0) (<= (+ ~res1~0 1) 0) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= ~n2~0 thread3Thread1of1ForFork0_~i~2) (<= (+ ~n1~0 1) ~n2~0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0))) (or (<= (+ ~n1~0 1) ~n2~0) (<= ~res2~0 0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0))) (or (<= (+ ~n1~0 1) ~n2~0) (<= ~n3~0 ~n1~0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0))) (or (<= ~n1~0 ~n3~0) (<= (+ ~res1~0 1) 0) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= (+ ~res1~0 1) 0) (= thread3Thread1of1ForFork0_~i~2 0) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= (+ ~res1~0 1) 0) (<= ~n3~0 ~n1~0) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= (+ ~res1~0 1) 0) (<= ~n3~0 (+ ~res1~0 ~n2~0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= ~n2~0 thread3Thread1of1ForFork0_~i~2) (<= (+ ~res1~0 1) 0) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= (+ ~res1~0 1) 0) (<= ~res2~0 0) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)))] [2022-03-15 18:49:46,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 18:49:46,820 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:49:46,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 18:49:46,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2022-03-15 18:49:46,820 INFO L87 Difference]: Start difference. First operand 249 states and 832 transitions. Second operand has 22 states, 21 states have (on average 4.761904761904762) internal successors, (100), 21 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:50,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:49:50,218 INFO L93 Difference]: Finished difference Result 800 states and 2661 transitions. [2022-03-15 18:49:50,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 18:49:50,218 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.761904761904762) internal successors, (100), 21 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:49:50,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:49:50,221 INFO L225 Difference]: With dead ends: 800 [2022-03-15 18:49:50,221 INFO L226 Difference]: Without dead ends: 702 [2022-03-15 18:49:50,222 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 40 SyntacticMatches, 35 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=453, Invalid=1709, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 18:49:50,222 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 770 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 18:49:50,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [770 Valid, 50 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 18:49:50,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2022-03-15 18:49:50,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 377. [2022-03-15 18:49:50,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 376 states have (on average 3.390957446808511) internal successors, (1275), 376 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:50,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1275 transitions. [2022-03-15 18:49:50,232 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1275 transitions. Word has length 22 [2022-03-15 18:49:50,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:49:50,232 INFO L470 AbstractCegarLoop]: Abstraction has 377 states and 1275 transitions. [2022-03-15 18:49:50,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.761904761904762) internal successors, (100), 21 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:50,232 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1275 transitions. [2022-03-15 18:49:50,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 18:49:50,233 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:49:50,233 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:49:50,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 18:49:50,233 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:49:50,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:49:50,234 INFO L85 PathProgramCache]: Analyzing trace with hash -426145815, now seen corresponding path program 1 times [2022-03-15 18:49:50,235 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:49:50,235 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826363422] [2022-03-15 18:49:50,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:49:50,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:49:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:49:50,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:49:50,340 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:49:50,342 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826363422] [2022-03-15 18:49:50,342 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826363422] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:49:50,342 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95646398] [2022-03-15 18:49:50,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:49:50,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:49:50,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:49:50,343 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-03-15 18:49:50,346 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-03-15 18:49:50,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:49:50,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 18:49:50,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:49:50,881 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:49:50,881 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 139 treesize of output 112 [2022-03-15 18:49:50,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:49:50,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:49:51,057 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:49:51,058 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 186 treesize of output 158 [2022-03-15 18:49:51,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:49:51,837 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95646398] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 18:49:51,837 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 18:49:51,837 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6, 10] total 25 [2022-03-15 18:49:51,837 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [416163068] [2022-03-15 18:49:51,837 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:49:51,840 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:49:51,860 INFO L252 McrAutomatonBuilder]: Finished intersection with 110 states and 247 transitions. [2022-03-15 18:49:51,860 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:49:52,858 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:52,872 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:57,126 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:57,238 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:57,293 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:58,831 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:58,989 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:49:59,071 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:01,575 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:01,642 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:01,701 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:01,940 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:02,120 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:02,359 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:08,405 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:08,450 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:09,426 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:09,529 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:11,093 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:11,129 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:11,213 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:11,280 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:13,703 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:15,517 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:15,550 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:15,641 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:17,889 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:17,903 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:18,374 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 27 new interpolants: [6490#(and (or (<= ~n2~0 thread3Thread1of1ForFork0_~i~2) (<= ~n3~0 thread3Thread1of1ForFork0_~i~2) (not (= ~n2~0 ~n1~0))) (or (< 0 ~res3~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (<= ~res2~0 0) (not (= ~n2~0 ~n1~0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (<= ~n3~0 ~n1~0) (< ~res3~0 0) (not (= (+ ~n1~0 (* (- 1) ~n2~0)) 0))) (or (<= ~n3~0 ~n2~0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (< ~res2~0 0) (not (= ~n2~0 ~n1~0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (< 0 ~res2~0) (not (< ~n3~0 ~n2~0)) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (not (= ~n2~0 ~n1~0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (< ~n1~0 ~n3~0) (<= 0 ~res3~0) (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (not (= ~n2~0 ~n1~0))) (or (<= 0 ~res3~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (< ~res2~0 0) (not (= ~n2~0 ~n1~0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (< 0 ~res2~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (not (< 0 ~res3~0)) (not (= ~n2~0 ~n1~0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (<= 0 ~res2~0) (< ~n2~0 ~n3~0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (not (= ~n2~0 ~n1~0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (< 0 ~res3~0) (<= ~n1~0 ~n3~0) (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (not (= (+ ~n1~0 (* (- 1) ~n2~0)) 0))) (or (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (not (< 0 ~res3~0)) (not (= (+ ~n1~0 (* (- 1) ~n2~0)) 0)) (< ~n3~0 ~n1~0)) (or (<= 0 ~res2~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (< ~res3~0 0) (not (= ~n2~0 ~n1~0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (<= ~res2~0 0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (not (= (+ ~n1~0 (* (- 1) ~n2~0)) 0)) (< ~n3~0 ~n2~0) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0))), 6475#(and (or (<= ~n1~0 ~n3~0) (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0) (< ~n3~0 ~n2~0)) (or (<= 0 ~res2~0) (< ~n2~0 ~n3~0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (<= ~res2~0 0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (not (= (+ ~n1~0 (* (- 1) ~n2~0)) 0)) (< ~n3~0 ~n2~0) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (<= 0 ~res3~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (< ~res2~0 0) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (<= 0 ~res2~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (< ~res3~0 0) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (not (< 0 ~res3~0)) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0) (< ~n3~0 ~n1~0)) (or (<= ~n3~0 ~n2~0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (< ~res2~0 0) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (<= ~n2~0 thread3Thread1of1ForFork0_~i~2) (<= ~n3~0 thread3Thread1of1ForFork0_~i~2) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (not (< ~n3~0 ~n2~0)) (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0) (< ~n3~0 ~n1~0)) (or (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (<= ~n3~0 ~n1~0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (< ~res3~0 0) (not (= (+ ~n1~0 (* (- 1) ~n2~0)) 0))) (or (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (not (< 0 ~res3~0)) (not (= (+ ~n1~0 (* (- 1) ~n2~0)) 0)) (< ~n3~0 ~n1~0)) (or (< 0 ~res2~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (not (< 0 ~res3~0)) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (<= ~n2~0 thread3Thread1of1ForFork0_~i~2) (<= ~n3~0 thread3Thread1of1ForFork0_~i~2) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (not (= ~n2~0 ~n1~0))) (or (< 0 ~res3~0) (<= ~n1~0 ~n3~0) (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= 0 ~res3~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (< ~res2~0 0) (not (= (+ ~n1~0 (* (- 1) ~n2~0)) 0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (< ~n1~0 ~n3~0) (<= ~n3~0 ~n2~0) (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (< 0 ~res2~0) (not (< ~n3~0 ~n2~0)) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (<= ~n3~0 ~n2~0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (< ~res2~0 0) (not (= ~n2~0 ~n1~0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (<= 0 ~res2~0) (< ~n2~0 ~n3~0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (not (= ~n2~0 ~n1~0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (< 0 ~res3~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (<= ~res2~0 0) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (<= ~n3~0 ~n1~0) (< ~res3~0 0) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= 0 ~res2~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (< ~res3~0 0) (not (= ~n2~0 ~n1~0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (< ~n1~0 ~n3~0) (<= 0 ~res3~0) (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (< ~n1~0 ~n3~0) (<= 0 ~res3~0) (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (not (= ~n2~0 ~n1~0))) (or (<= ~res2~0 0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0) (< ~n3~0 ~n2~0) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (< 0 ~res3~0) (<= ~n1~0 ~n3~0) (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (not (= (+ ~n1~0 (* (- 1) ~n2~0)) 0))) (or (< 0 ~res2~0) (not (< ~n3~0 ~n2~0)) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (not (= ~n2~0 ~n1~0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (< 0 ~res3~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (<= ~res2~0 0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (not (= ~n2~0 ~n1~0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (< ~n2~0 ~n3~0) (<= ~n3~0 ~n1~0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (< 0 ~res2~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (not (< 0 ~res3~0)) (not (= ~n2~0 ~n1~0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0))), 6471#(and (or (<= ~n3~0 ~n2~0) (< ~res2~0 0) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= ~n2~0 0) (<= ~n3~0 0) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= ~res2~0 0) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0) (< ~n3~0 ~n2~0)) (or (<= ~res2~0 0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (not (= ~n2~0 ~n1~0)) (< ~n3~0 ~n2~0)) (or (< 0 ~res2~0) (not (< ~n3~0 ~n2~0)) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (not (= ~n2~0 ~n1~0))) (or (<= 0 ~res2~0) (< ~n2~0 ~n3~0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (not (= ~n2~0 ~n1~0))) (or (<= ~n3~0 ~n2~0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (< ~res2~0 0) (not (= ~n2~0 ~n1~0))) (or (<= ~n2~0 0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (<= ~n3~0 0) (not (= ~n2~0 ~n1~0))) (or (<= 0 ~res2~0) (< ~n2~0 ~n3~0) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (< 0 ~res2~0) (not (< ~n3~0 ~n2~0)) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0))), 6489#(and (or (< 0 ~res3~0) (<= ~n1~0 ~n3~0) (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (not (= (+ ~n1~0 (* (- 1) ~n2~0)) 0))) (or (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (<= ~n3~0 ~n1~0) (< ~res3~0 0) (not (= (+ ~n1~0 (* (- 1) ~n2~0)) 0))) (or (< ~n1~0 ~n3~0) (<= 0 ~res3~0) (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (not (= ~n2~0 ~n1~0))) (or (<= 0 ~res3~0) (< ~res2~0 0) (not (= ~n2~0 ~n1~0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (<= 0 ~res2~0) (< ~res3~0 0) (not (= (+ ~n1~0 (* (- 1) ~n2~0)) 0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (<= ~res3~0 0) (< 0 ~res2~0) (not (= ~n2~0 ~n1~0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (< 0 ~res3~0) (<= ~res2~0 0) (not (= ~n2~0 ~n1~0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (<= ~res3~0 0) (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (not (= ~n2~0 ~n1~0)) (< ~n3~0 ~n1~0))), 6493#(and (or (< 0 ~res3~0) (<= ~n1~0 ~n3~0) (not (= (+ ~n1~0 (* (- 1) ~n2~0)) 0))) (or (<= ~res3~0 0) (not (= ~n2~0 ~n1~0)) (< ~n3~0 ~n1~0)) (or (< ~n1~0 ~n3~0) (<= 0 ~res3~0) (not (= ~n2~0 ~n1~0))) (or (<= ~n3~0 ~n1~0) (< ~res3~0 0) (not (= (+ ~n1~0 (* (- 1) ~n2~0)) 0)))), 6483#(and (or (<= ~n1~0 ~n3~0) (not (= ~res1~0 0)) (< ~n3~0 ~n2~0)) (or (< ~n1~0 ~n3~0) (<= ~n3~0 ~n2~0) (not (= ~res1~0 0))) (or (not (< ~n3~0 ~n2~0)) (not (= ~res1~0 0)) (< ~n3~0 ~n1~0)) (or (< ~n2~0 ~n3~0) (<= ~n3~0 ~n1~0) (not (= ~res1~0 0))) (or (<= ~n2~0 0) (<= ~n3~0 0) (not (= ~res1~0 0)))), 6494#(and (or (<= ~n2~0 thread3Thread1of1ForFork0_~i~2) (<= ~n3~0 thread3Thread1of1ForFork0_~i~2) (not (= ~n2~0 ~n1~0))) (or (< 0 ~res3~0) (<= ~n1~0 ~n3~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (not (= (+ ~n1~0 (* (- 1) ~n2~0)) 0))) (or (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (<= ~n3~0 ~n1~0) (< ~res3~0 0) (not (= (+ ~n1~0 (* (- 1) ~n2~0)) 0))) (or (< ~n1~0 ~n3~0) (<= 0 ~res3~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (not (= ~n2~0 ~n1~0))) (or (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (not (< 0 ~res3~0)) (not (= (+ ~n1~0 (* (- 1) ~n2~0)) 0)) (< ~n3~0 ~n1~0))), 6492#(and (or (<= ~n2~0 0) (not (= ~n2~0 ~n1~0))) (or (not (= ~n2~0 ~n1~0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0))), 6495#(or (<= ~n2~0 0) (<= ~n3~0 0) (not (= ~n2~0 ~n1~0))), 6485#(and (or (<= ~n1~0 ~n2~0) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= ~n2~0 0) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0) (<= ~n2~0 ~n1~0)) (or (<= ~n2~0 0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (not (= ~n2~0 ~n1~0)))), 6482#(and (or (< ~n2~0 ~n3~0) (<= ~n3~0 ~n1~0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (not (< ~n3~0 ~n2~0)) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0) (< ~n3~0 ~n1~0)) (or (<= ~n1~0 ~n3~0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0) (< ~n3~0 ~n2~0)) (or (<= ~n2~0 thread3Thread1of1ForFork0_~i~2) (<= ~n3~0 thread3Thread1of1ForFork0_~i~2) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (< ~n1~0 ~n3~0) (<= 0 ~res3~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (not (< 0 ~res3~0)) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0) (< ~n3~0 ~n1~0)) (or (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (<= ~n3~0 ~n1~0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (< ~res3~0 0) (not (= (+ ~n1~0 (* (- 1) ~n2~0)) 0))) (or (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (<= ~n3~0 ~n1~0) (< ~res3~0 0) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= ~n2~0 thread3Thread1of1ForFork0_~i~2) (<= ~n3~0 thread3Thread1of1ForFork0_~i~2) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (not (= ~n2~0 ~n1~0))) (or (< 0 ~res3~0) (<= ~n1~0 ~n3~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= ~res3~0 0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (not (= ~n2~0 ~n1~0)) (< ~n3~0 ~n1~0)) (or (< ~n1~0 ~n3~0) (<= 0 ~res3~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (not (= (+ ~n1~0 (* (- 1) ~n2~0)) 0))) (or (< 0 ~res3~0) (<= ~n1~0 ~n3~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (not (= (+ ~n1~0 (* (- 1) ~n2~0)) 0))) (or (< ~n1~0 ~n3~0) (<= ~n3~0 ~n2~0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0))), 6474#(and (or (<= ~n1~0 ~n3~0) (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (not (= ~res1~0 0)) (< ~n3~0 ~n2~0)) (or (< 0 ~res2~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (not (< 0 ~res3~0)) (not (= ~res1~0 0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (<= 0 ~res2~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (< ~res3~0 0) (not (= ~res1~0 0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (not (< 0 ~res3~0)) (not (= ~res1~0 0)) (< ~n3~0 ~n1~0)) (or (< 0 ~res3~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (<= ~res2~0 0) (not (= ~res1~0 0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (<= ~n3~0 ~n1~0) (< ~res3~0 0) (not (= ~res1~0 0))) (or (<= 0 ~res2~0) (< ~n2~0 ~n3~0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (not (= ~res1~0 0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (not (< ~n3~0 ~n2~0)) (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (not (= ~res1~0 0)) (< ~n3~0 ~n1~0)) (or (< 0 ~res3~0) (<= ~n1~0 ~n3~0) (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (not (= ~res1~0 0))) (or (<= ~n2~0 thread3Thread1of1ForFork0_~i~2) (<= ~n3~0 thread3Thread1of1ForFork0_~i~2) (not (= ~res1~0 0))) (or (<= ~res2~0 0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (not (= ~res1~0 0)) (< ~n3~0 ~n2~0) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (<= ~n3~0 ~n2~0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (< ~res2~0 0) (not (= ~res1~0 0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (<= 0 ~res3~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (< ~res2~0 0) (not (= ~res1~0 0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (< 0 ~res2~0) (not (< ~n3~0 ~n2~0)) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (not (= ~res1~0 0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (< ~n1~0 ~n3~0) (<= ~n3~0 ~n2~0) (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (not (= ~res1~0 0))) (or (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (< ~n2~0 ~n3~0) (<= ~n3~0 ~n1~0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (not (= ~res1~0 0))) (or (< ~n1~0 ~n3~0) (<= 0 ~res3~0) (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (not (= ~res1~0 0)))), 6484#(and (or (< ~n1~0 ~n3~0) (<= ~n3~0 ~n2~0) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= ~n2~0 0) (<= ~n3~0 0) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (< ~n2~0 ~n3~0) (<= ~n3~0 ~n1~0) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= ~n2~0 0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (<= ~n3~0 0) (not (= ~n2~0 ~n1~0))) (or (<= ~n1~0 ~n3~0) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0) (< ~n3~0 ~n2~0)) (or (not (< ~n3~0 ~n2~0)) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0) (< ~n3~0 ~n1~0))), 6476#(and (or (< 0 ~res2~0) (not (< ~n3~0 ~n2~0)) (not (= ~res1~0 0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (<= ~res2~0 0) (not (= ~res1~0 0)) (< ~n3~0 ~n2~0) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (not (< ~n3~0 ~n2~0)) (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (not (= ~res1~0 0)) (< ~n3~0 ~n1~0)) (or (<= 0 ~res2~0) (< ~n2~0 ~n3~0) (not (= ~res1~0 0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (< ~n2~0 ~n3~0) (<= ~n3~0 ~n1~0) (not (= ~res1~0 0))) (or (<= ~n3~0 ~n2~0) (< ~res2~0 0) (not (= ~res1~0 0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (<= ~n1~0 ~n3~0) (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (not (= ~res1~0 0)) (< ~n3~0 ~n2~0)) (or (< ~n1~0 ~n3~0) (<= ~n3~0 ~n2~0) (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (not (= ~res1~0 0))) (or (<= ~n2~0 0) (<= ~n3~0 0) (not (= ~res1~0 0)))), 6479#(and (or (<= ~n3~0 ~n1~0) (< ~res3~0 0) (not (= ~res1~0 0))) (or (< ~n1~0 ~n3~0) (<= 0 ~res3~0) (not (= ~res1~0 0))) (or (not (< 0 ~res3~0)) (not (= ~res1~0 0)) (< ~n3~0 ~n1~0)) (or (< 0 ~res3~0) (<= ~n1~0 ~n3~0) (not (= ~res1~0 0)))), 6470#(and (or (< 0 ~res2~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (not (< 0 ~res3~0)) (not (= ~n2~0 ~n1~0))) (or (< 0 ~res2~0) (not (< ~n3~0 ~n2~0)) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= 0 ~res3~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (< ~res2~0 0) (not (= ~n2~0 ~n1~0))) (or (<= ~res2~0 0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (not (= ~n2~0 ~n1~0)) (< ~n3~0 ~n2~0)) (or (<= ~n2~0 thread3Thread1of1ForFork0_~i~2) (<= ~n3~0 thread3Thread1of1ForFork0_~i~2) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= 0 ~res2~0) (< ~n2~0 ~n3~0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (not (= ~n2~0 ~n1~0))) (or (< 0 ~res2~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (not (< 0 ~res3~0)) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= 0 ~res2~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (< ~res3~0 0) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= 0 ~res3~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (< ~res2~0 0) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= 0 ~res2~0) (< ~n2~0 ~n3~0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= 0 ~res2~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (< ~res3~0 0) (not (= ~n2~0 ~n1~0))) (or (< 0 ~res2~0) (not (< ~n3~0 ~n2~0)) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (not (= ~n2~0 ~n1~0))) (or (<= ~n2~0 thread3Thread1of1ForFork0_~i~2) (<= ~n3~0 thread3Thread1of1ForFork0_~i~2) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (not (= ~n2~0 ~n1~0))) (or (<= ~res2~0 0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0) (< ~n3~0 ~n2~0)) (or (< 0 ~res3~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (<= ~res2~0 0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (not (= ~n2~0 ~n1~0))) (or (<= ~n3~0 ~n2~0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (< ~res2~0 0) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= ~n3~0 ~n2~0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (< ~res2~0 0) (not (= ~n2~0 ~n1~0))) (or (< 0 ~res3~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (<= ~res2~0 0) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0))), 6486#(and (or (< 0 ~res3~0) (<= ~res2~0 0) (not (= ~n2~0 ~n1~0))) (or (<= 0 ~res3~0) (< ~res2~0 0) (not (= ~n2~0 ~n1~0))) (or (<= ~res3~0 0) (< 0 ~res2~0) (not (= ~n2~0 ~n1~0))) (or (<= 0 ~res2~0) (< ~res3~0 0) (not (= ~n2~0 ~n1~0)))), 6480#(and (or (< ~n1~0 ~n3~0) (<= ~n3~0 ~n2~0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (not (= ~res1~0 0))) (or (not (< ~n3~0 ~n2~0)) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (not (= ~res1~0 0)) (< ~n3~0 ~n1~0)) (or (< ~n1~0 ~n3~0) (<= 0 ~res3~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (not (= ~res1~0 0))) (or (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (<= ~n3~0 ~n1~0) (< ~res3~0 0) (not (= ~res1~0 0))) (or (< ~n2~0 ~n3~0) (<= ~n3~0 ~n1~0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (not (= ~res1~0 0))) (or (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (not (< 0 ~res3~0)) (not (= ~res1~0 0)) (< ~n3~0 ~n1~0)) (or (<= ~n1~0 ~n3~0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (not (= ~res1~0 0)) (< ~n3~0 ~n2~0)) (or (<= ~n2~0 thread3Thread1of1ForFork0_~i~2) (<= ~n3~0 thread3Thread1of1ForFork0_~i~2) (not (= ~res1~0 0))) (or (< 0 ~res3~0) (<= ~n1~0 ~n3~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (not (= ~res1~0 0)))), 6478#(and (or (<= ~n1~0 ~n2~0) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (not (= ~n2~0 ~n1~0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (<= ~n2~0 0) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0) (<= ~n2~0 ~n1~0)) (or (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (<= ~n2~0 0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (not (= ~n2~0 ~n1~0)))), 6472#(and (or (< 0 ~res3~0) (<= ~res2~0 0) (not (= ~res1~0 0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (< ~n1~0 ~n3~0) (<= 0 ~res3~0) (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (not (= ~res1~0 0))) (or (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (not (< 0 ~res3~0)) (not (= ~res1~0 0)) (< ~n3~0 ~n1~0)) (or (<= 0 ~res2~0) (< ~res3~0 0) (not (= ~res1~0 0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (< 0 ~res3~0) (<= ~n1~0 ~n3~0) (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (not (= ~res1~0 0))) (or (<= 0 ~res3~0) (< ~res2~0 0) (not (= ~res1~0 0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (<= ~n3~0 ~n1~0) (< ~res3~0 0) (not (= ~res1~0 0))) (or (< 0 ~res2~0) (not (< 0 ~res3~0)) (not (= ~res1~0 0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0))), 6488#(and (or (<= ~n3~0 ~n2~0) (< ~res2~0 0) (not (= ~n2~0 ~n1~0))) (or (<= 0 ~res2~0) (< ~n2~0 ~n3~0) (not (= ~n2~0 ~n1~0))) (or (< 0 ~res2~0) (not (< ~n3~0 ~n2~0)) (not (= ~n2~0 ~n1~0))) (or (<= ~n2~0 0) (<= ~n3~0 0) (not (= ~n2~0 ~n1~0))) (or (<= ~res2~0 0) (not (= ~n2~0 ~n1~0)) (< ~n3~0 ~n2~0))), 6491#(and (or (< 0 ~res2~0) (not (< ~n3~0 ~n2~0)) (not (= ~n2~0 ~n1~0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (<= ~n3~0 ~n2~0) (< ~res2~0 0) (not (= ~n2~0 ~n1~0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (<= ~n2~0 0) (<= ~n3~0 0) (not (= ~n2~0 ~n1~0))) (or (<= ~res2~0 0) (not (= ~n2~0 ~n1~0)) (< ~n3~0 ~n2~0) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (<= 0 ~res2~0) (< ~n2~0 ~n3~0) (not (= ~n2~0 ~n1~0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0))), 6477#(and (or (< 0 ~res2~0) (not (< ~n3~0 ~n2~0)) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (not (= ~n2~0 ~n1~0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (<= ~n2~0 0) (<= ~n3~0 0) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= 0 ~res2~0) (< ~n2~0 ~n3~0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (not (= ~n2~0 ~n1~0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (<= ~n3~0 ~n2~0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (< ~res2~0 0) (not (= ~n2~0 ~n1~0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (<= 0 ~res2~0) (< ~n2~0 ~n3~0) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (< 0 ~res2~0) (not (< ~n3~0 ~n2~0)) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (<= ~res2~0 0) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0) (< ~n3~0 ~n2~0) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (<= ~n1~0 ~n3~0) (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0) (< ~n3~0 ~n2~0)) (or (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (< ~n2~0 ~n3~0) (<= ~n3~0 ~n1~0) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= ~n2~0 0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (<= ~n3~0 0) (not (= ~n2~0 ~n1~0))) (or (not (< ~n3~0 ~n2~0)) (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0) (< ~n3~0 ~n1~0)) (or (< ~n1~0 ~n3~0) (<= ~n3~0 ~n2~0) (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= ~n3~0 ~n2~0) (< ~res2~0 0) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (<= ~res2~0 0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (not (= (+ ~n1~0 (* (- 1) ~n2~0)) 0)) (< ~n3~0 ~n2~0) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0))), 6481#(and (or (< 0 ~res3~0) (<= ~n1~0 ~n3~0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (not (= (+ ~n1~0 (* (- 1) ~n2~0)) 0))) (or (< ~n1~0 ~n3~0) (<= 0 ~res3~0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (not (= (+ ~n1~0 (* (- 1) ~n2~0)) 0))) (or (not (< 0 ~res3~0)) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0) (< ~n3~0 ~n1~0)) (or (<= ~res3~0 0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (not (= ~n2~0 ~n1~0)) (< ~n3~0 ~n1~0)) (or (< 0 ~res3~0) (<= ~n1~0 ~n3~0) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= ~n3~0 ~n1~0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (< ~res3~0 0) (not (= (+ ~n1~0 (* (- 1) ~n2~0)) 0))) (or (< ~n1~0 ~n3~0) (<= 0 ~res3~0) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= ~n3~0 ~n1~0) (< ~res3~0 0) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0))), 6473#(and (or (< ~n1~0 ~n3~0) (<= 0 ~res3~0) (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (< 0 ~res3~0) (<= ~n1~0 ~n3~0) (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (< 0 ~res3~0) (<= ~n1~0 ~n3~0) (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (not (= (+ ~n1~0 (* (- 1) ~n2~0)) 0))) (or (<= 0 ~res2~0) (< ~res3~0 0) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (< 0 ~res3~0) (<= ~res2~0 0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (not (= (+ ~n1~0 (* (- 1) ~n2~0)) 0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (< ~n1~0 ~n3~0) (<= 0 ~res3~0) (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (not (= (+ ~n1~0 (* (- 1) ~n2~0)) 0))) (or (<= 0 ~res3~0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (< ~res2~0 0) (not (= (+ ~n1~0 (* (- 1) ~n2~0)) 0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (<= ~n3~0 ~n1~0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (< ~res3~0 0) (not (= (+ ~n1~0 (* (- 1) ~n2~0)) 0))) (or (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (not (< 0 ~res3~0)) (not (= (+ ~n1~0 (* (- 1) ~n2~0)) 0)) (< ~n3~0 ~n1~0)) (or (<= 0 ~res3~0) (< ~res2~0 0) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (< 0 ~res3~0) (<= ~res2~0 0) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (not (< 0 ~res3~0)) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0) (< ~n3~0 ~n1~0)) (or (<= 0 ~res2~0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (< ~res3~0 0) (not (= (+ ~n1~0 (* (- 1) ~n2~0)) 0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (< 0 ~res2~0) (not (< 0 ~res3~0)) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (< 0 ~res2~0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (not (< 0 ~res3~0)) (not (= (+ ~n1~0 (* (- 1) ~n2~0)) 0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (<= ~n3~0 ~n1~0) (< ~res3~0 0) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0))), 6469#(and (or (< 0 ~res3~0) (<= ~res2~0 0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (not (= ~n2~0 ~n1~0))) (or (<= 0 ~res2~0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (< ~res3~0 0) (not (= ~n2~0 ~n1~0))) (or (<= 0 ~res2~0) (< ~res3~0 0) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (<= 0 ~res3~0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (< ~res2~0 0) (not (= ~n2~0 ~n1~0))) (or (< 0 ~res2~0) (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (not (< 0 ~res3~0)) (not (= ~n2~0 ~n1~0))) (or (<= 0 ~res3~0) (< ~res2~0 0) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (< 0 ~res3~0) (<= ~res2~0 0) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (< 0 ~res2~0) (not (< 0 ~res3~0)) (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0))), 6487#(and (or (<= ~n2~0 thread3Thread1of1ForFork0_~i~2) (<= ~n3~0 thread3Thread1of1ForFork0_~i~2) (not (= ~n2~0 ~n1~0))) (or (<= 0 ~res2~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (< ~res3~0 0) (not (= ~n2~0 ~n1~0))) (or (<= ~res2~0 0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (not (= ~n2~0 ~n1~0)) (< ~n3~0 ~n2~0)) (or (<= 0 ~res3~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (< ~res2~0 0) (not (= ~n2~0 ~n1~0))) (or (<= ~res3~0 0) (< 0 ~res2~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (not (= ~n2~0 ~n1~0))) (or (< 0 ~res2~0) (<= ~n2~0 ~n3~0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (not (= ~n2~0 ~n1~0))) (or (<= 0 ~res2~0) (< ~n2~0 ~n3~0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (not (= ~n2~0 ~n1~0))) (or (< 0 ~res3~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (<= ~res2~0 0) (not (= ~n2~0 ~n1~0))) (or (<= ~n3~0 ~n2~0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (< ~res2~0 0) (not (= ~n2~0 ~n1~0))))] [2022-03-15 18:50:18,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 18:50:18,374 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:50:18,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 18:50:18,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=2401, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 18:50:18,375 INFO L87 Difference]: Start difference. First operand 377 states and 1275 transitions. Second operand has 37 states, 36 states have (on average 4.138888888888889) internal successors, (149), 37 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:50:30,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:50:30,732 INFO L93 Difference]: Finished difference Result 853 states and 2889 transitions. [2022-03-15 18:50:30,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-15 18:50:30,733 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 4.138888888888889) internal successors, (149), 37 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 18:50:30,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:50:30,737 INFO L225 Difference]: With dead ends: 853 [2022-03-15 18:50:30,737 INFO L226 Difference]: Without dead ends: 796 [2022-03-15 18:50:30,738 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 75 SyntacticMatches, 12 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2192 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=1194, Invalid=6462, Unknown=0, NotChecked=0, Total=7656 [2022-03-15 18:50:30,739 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 896 mSDsluCounter, 2439 mSDsCounter, 0 mSdLazyCounter, 3903 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 4090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 3903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-03-15 18:50:30,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [896 Valid, 171 Invalid, 4090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 3903 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-03-15 18:50:30,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2022-03-15 18:50:30,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 464. [2022-03-15 18:50:30,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 463 states have (on average 3.345572354211663) internal successors, (1549), 463 states have internal predecessors, (1549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:50:30,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1549 transitions. [2022-03-15 18:50:30,750 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1549 transitions. Word has length 23 [2022-03-15 18:50:30,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:50:30,751 INFO L470 AbstractCegarLoop]: Abstraction has 464 states and 1549 transitions. [2022-03-15 18:50:30,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 4.138888888888889) internal successors, (149), 37 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:50:30,751 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1549 transitions. [2022-03-15 18:50:30,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 18:50:30,752 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:50:30,752 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:50:30,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-15 18:50:30,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-03-15 18:50:30,969 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:50:30,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:50:30,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1694460198, now seen corresponding path program 1 times [2022-03-15 18:50:30,970 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:50:30,970 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23979651] [2022-03-15 18:50:30,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:50:30,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:50:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:50:31,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:50:31,043 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:50:31,043 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23979651] [2022-03-15 18:50:31,043 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23979651] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:50:31,043 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321839632] [2022-03-15 18:50:31,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:50:31,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:50:31,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:50:31,044 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-03-15 18:50:31,045 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-03-15 18:50:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:50:31,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 18:50:31,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:50:31,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:50:31,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:50:31,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:50:31,289 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321839632] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 18:50:31,289 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 18:50:31,289 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 14 [2022-03-15 18:50:31,290 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [89768801] [2022-03-15 18:50:31,290 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:50:31,292 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:50:31,313 INFO L252 McrAutomatonBuilder]: Finished intersection with 111 states and 248 transitions. [2022-03-15 18:50:31,313 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:50:32,387 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 18:50:32,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 18:50:32,388 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:50:32,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 18:50:32,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-03-15 18:50:32,388 INFO L87 Difference]: Start difference. First operand 464 states and 1549 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:50:32,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:50:32,620 INFO L93 Difference]: Finished difference Result 794 states and 2566 transitions. [2022-03-15 18:50:32,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 18:50:32,621 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 18:50:32,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:50:32,624 INFO L225 Difference]: With dead ends: 794 [2022-03-15 18:50:32,624 INFO L226 Difference]: Without dead ends: 794 [2022-03-15 18:50:32,624 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 122 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-03-15 18:50:32,624 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 77 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:50:32,625 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 14 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:50:32,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2022-03-15 18:50:32,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 520. [2022-03-15 18:50:32,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 519 states have (on average 3.3448940269749516) internal successors, (1736), 519 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:50:32,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1736 transitions. [2022-03-15 18:50:32,650 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 1736 transitions. Word has length 24 [2022-03-15 18:50:32,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:50:32,650 INFO L470 AbstractCegarLoop]: Abstraction has 520 states and 1736 transitions. [2022-03-15 18:50:32,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:50:32,650 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 1736 transitions. [2022-03-15 18:50:32,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 18:50:32,652 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:50:32,652 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:50:32,670 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-03-15 18:50:32,863 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,SelfDestructingSolverStorable6 [2022-03-15 18:50:32,864 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:50:32,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:50:32,864 INFO L85 PathProgramCache]: Analyzing trace with hash -715133407, now seen corresponding path program 1 times [2022-03-15 18:50:32,864 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:50:32,865 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906713737] [2022-03-15 18:50:32,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:50:32,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:50:32,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:50:32,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:50:32,919 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:50:32,919 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906713737] [2022-03-15 18:50:32,919 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906713737] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:50:32,919 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:50:32,919 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 18:50:32,919 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2051511378] [2022-03-15 18:50:32,919 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:50:32,922 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:50:32,964 INFO L252 McrAutomatonBuilder]: Finished intersection with 187 states and 463 transitions. [2022-03-15 18:50:32,964 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:50:34,386 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [10349#(<= ~n1~0 thread2Thread1of1ForFork2_~i~1)] [2022-03-15 18:50:34,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 18:50:34,387 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:50:34,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 18:50:34,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-15 18:50:34,387 INFO L87 Difference]: Start difference. First operand 520 states and 1736 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:50:34,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:50:34,480 INFO L93 Difference]: Finished difference Result 606 states and 1969 transitions. [2022-03-15 18:50:34,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 18:50:34,480 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 18:50:34,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:50:34,482 INFO L225 Difference]: With dead ends: 606 [2022-03-15 18:50:34,482 INFO L226 Difference]: Without dead ends: 519 [2022-03-15 18:50:34,482 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 160 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-15 18:50:34,483 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 16 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:50:34,483 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 3 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 18:50:34,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-03-15 18:50:34,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 519. [2022-03-15 18:50:34,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 518 states have (on average 3.3455598455598454) internal successors, (1733), 518 states have internal predecessors, (1733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:50:34,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 1733 transitions. [2022-03-15 18:50:34,492 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 1733 transitions. Word has length 25 [2022-03-15 18:50:34,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:50:34,492 INFO L470 AbstractCegarLoop]: Abstraction has 519 states and 1733 transitions. [2022-03-15 18:50:34,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:50:34,493 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 1733 transitions. [2022-03-15 18:50:34,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 18:50:34,494 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:50:34,494 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:50:34,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 18:50:34,494 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:50:34,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:50:34,494 INFO L85 PathProgramCache]: Analyzing trace with hash 416728898, now seen corresponding path program 1 times [2022-03-15 18:50:34,495 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:50:34,495 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021365697] [2022-03-15 18:50:34,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:50:34,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:50:34,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:50:34,703 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:50:34,704 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:50:34,704 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021365697] [2022-03-15 18:50:34,704 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021365697] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:50:34,704 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607008142] [2022-03-15 18:50:34,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:50:34,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:50:34,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:50:34,705 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-03-15 18:50:34,705 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-03-15 18:50:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:50:34,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 18:50:34,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:50:35,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:50:35,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:50:35,272 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:50:35,273 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 186 treesize of output 158 [2022-03-15 18:50:36,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:50:36,271 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607008142] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 18:50:36,271 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 18:50:36,271 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10, 10] total 29 [2022-03-15 18:50:36,271 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1082904801] [2022-03-15 18:50:36,271 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:50:36,274 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:50:36,306 INFO L252 McrAutomatonBuilder]: Finished intersection with 148 states and 354 transitions. [2022-03-15 18:50:36,306 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:50:37,008 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:37,065 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:37,071 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:38,936 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:38,990 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:38,995 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:40,883 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:42,015 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:42,105 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:42,114 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:43,162 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:44,232 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:44,328 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:44,333 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:47,970 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:49,413 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:49,484 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:49,489 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:51,494 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:52,412 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:52,486 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:52,492 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:55,269 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:55,303 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:55,933 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:55,971 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:56,405 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:56,440 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:56,832 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:56,871 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:57,847 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:57,882 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:58,462 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:58,501 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:51:00,578 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [12177#(and (or (<= ~n3~0 ~n1~0) (< ~res3~0 0)) (or (< ~n1~0 ~n3~0) (<= 0 ~res3~0)) (or (not (< 0 ~res3~0)) (< ~n3~0 ~n1~0)) (or (< 0 ~res3~0) (<= ~n1~0 ~n3~0))), 12176#(and (or (< 0 ~res2~0) (not (< ~n3~0 ~n2~0)) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (<= 0 ~res2~0) (< ~n2~0 ~n3~0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (not (< ~n3~0 ~n2~0)) (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (< ~n3~0 ~n1~0)) (or (<= 0 ~res3~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (< ~res2~0 0) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (not (< 0 ~res3~0)) (< ~n3~0 ~n1~0)) (or (<= ~n2~0 thread3Thread1of1ForFork0_~i~2) (<= ~n3~0 thread3Thread1of1ForFork0_~i~2)) (or (< 0 ~res3~0) (<= ~n1~0 ~n3~0) (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (or (< 0 ~res3~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (<= ~res2~0 0) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (<= 0 ~res2~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (< ~res3~0 0) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (< ~n1~0 ~n3~0) (<= ~n3~0 ~n2~0) (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0))) (or (<= ~res2~0 0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (< ~n3~0 ~n2~0) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (< ~n2~0 ~n3~0) (<= ~n3~0 ~n1~0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0))) (or (<= ~n1~0 ~n3~0) (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (< ~n3~0 ~n2~0)) (or (< ~n1~0 ~n3~0) (<= 0 ~res3~0) (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (or (<= ~n3~0 ~n2~0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (< ~res2~0 0) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (< 0 ~res2~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (not (< 0 ~res3~0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (<= ~n3~0 ~n1~0) (< ~res3~0 0))), 12178#(and (or (< ~n2~0 ~n3~0) (<= ~n3~0 ~n1~0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0))) (or (< ~n1~0 ~n3~0) (<= ~n3~0 ~n2~0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0))) (or (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (<= ~n3~0 ~n1~0) (< ~res3~0 0)) (or (<= ~n2~0 thread3Thread1of1ForFork0_~i~2) (<= ~n3~0 thread3Thread1of1ForFork0_~i~2)) (or (<= ~n1~0 ~n3~0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (< ~n3~0 ~n2~0)) (or (< ~n1~0 ~n3~0) (<= 0 ~res3~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (or (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (not (< 0 ~res3~0)) (< ~n3~0 ~n1~0)) (or (not (< ~n3~0 ~n2~0)) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (< ~n3~0 ~n1~0)) (or (< 0 ~res3~0) (<= ~n1~0 ~n3~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0))), 12175#(and (or (< 0 ~res3~0) (<= ~n1~0 ~n3~0) (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0))) (or (< ~n1~0 ~n3~0) (<= 0 ~res3~0) (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0))) (or (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (<= ~n3~0 ~n1~0) (< ~res3~0 0)) (or (<= 0 ~res2~0) (< ~res3~0 0) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (< 0 ~res2~0) (not (< 0 ~res3~0)) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (not (< 0 ~res3~0)) (< ~n3~0 ~n1~0)) (or (< 0 ~res3~0) (<= ~res2~0 0) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (or (<= 0 ~res3~0) (< ~res2~0 0) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)))] [2022-03-15 18:51:00,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 18:51:00,578 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:51:00,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 18:51:00,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1044, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 18:51:00,579 INFO L87 Difference]: Start difference. First operand 519 states and 1733 transitions. Second operand has 16 states, 15 states have (on average 6.533333333333333) internal successors, (98), 15 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:51:02,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:51:02,471 INFO L93 Difference]: Finished difference Result 896 states and 2819 transitions. [2022-03-15 18:51:02,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 18:51:02,471 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.533333333333333) internal successors, (98), 15 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 18:51:02,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:51:02,475 INFO L225 Difference]: With dead ends: 896 [2022-03-15 18:51:02,475 INFO L226 Difference]: Without dead ends: 843 [2022-03-15 18:51:02,475 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 74 SyntacticMatches, 74 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2044 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=458, Invalid=2298, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 18:51:02,476 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 394 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 18:51:02,476 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [394 Valid, 31 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 18:51:02,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2022-03-15 18:51:02,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 725. [2022-03-15 18:51:02,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 724 states have (on average 3.3314917127071824) internal successors, (2412), 724 states have internal predecessors, (2412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:51:02,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 2412 transitions. [2022-03-15 18:51:02,492 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 2412 transitions. Word has length 26 [2022-03-15 18:51:02,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:51:02,492 INFO L470 AbstractCegarLoop]: Abstraction has 725 states and 2412 transitions. [2022-03-15 18:51:02,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.533333333333333) internal successors, (98), 15 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:51:02,492 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 2412 transitions. [2022-03-15 18:51:02,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 18:51:02,494 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:51:02,494 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:51:02,512 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-03-15 18:51:02,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:51:02,701 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:51:02,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:51:02,701 INFO L85 PathProgramCache]: Analyzing trace with hash 117574009, now seen corresponding path program 1 times [2022-03-15 18:51:02,702 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:51:02,702 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153473315] [2022-03-15 18:51:02,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:51:02,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:51:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:51:02,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:51:02,742 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:51:02,742 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153473315] [2022-03-15 18:51:02,742 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153473315] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:51:02,742 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:51:02,742 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 18:51:02,742 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1377786747] [2022-03-15 18:51:02,742 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:51:02,745 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:51:02,794 INFO L252 McrAutomatonBuilder]: Finished intersection with 188 states and 464 transitions. [2022-03-15 18:51:02,795 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:51:04,167 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [14566#(<= ~n3~0 thread2Thread1of1ForFork2_~i~1)] [2022-03-15 18:51:04,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 18:51:04,168 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:51:04,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 18:51:04,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-15 18:51:04,168 INFO L87 Difference]: Start difference. First operand 725 states and 2412 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:51:04,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:51:04,270 INFO L93 Difference]: Finished difference Result 693 states and 2195 transitions. [2022-03-15 18:51:04,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 18:51:04,270 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 18:51:04,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:51:04,273 INFO L225 Difference]: With dead ends: 693 [2022-03-15 18:51:04,273 INFO L226 Difference]: Without dead ends: 521 [2022-03-15 18:51:04,273 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 161 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-03-15 18:51:04,273 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 31 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:51:04,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 3 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 18:51:04,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2022-03-15 18:51:04,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 521. [2022-03-15 18:51:04,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 520 states have (on average 3.3365384615384617) internal successors, (1735), 520 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:51:04,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 1735 transitions. [2022-03-15 18:51:04,283 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 1735 transitions. Word has length 26 [2022-03-15 18:51:04,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:51:04,283 INFO L470 AbstractCegarLoop]: Abstraction has 521 states and 1735 transitions. [2022-03-15 18:51:04,283 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:51:04,283 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 1735 transitions. [2022-03-15 18:51:04,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 18:51:04,284 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:51:04,284 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:51:04,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-15 18:51:04,285 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:51:04,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:51:04,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1435734483, now seen corresponding path program 1 times [2022-03-15 18:51:04,285 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:51:04,286 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93107051] [2022-03-15 18:51:04,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:51:04,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:51:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:51:04,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 18:51:04,356 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:51:04,356 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93107051] [2022-03-15 18:51:04,356 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93107051] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:51:04,356 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505588430] [2022-03-15 18:51:04,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:51:04,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:51:04,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:51:04,357 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-03-15 18:51:04,358 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-03-15 18:51:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:51:04,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 18:51:04,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:51:04,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 18:51:04,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:51:04,608 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 18:51:04,608 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505588430] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 18:51:04,608 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 18:51:04,608 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2022-03-15 18:51:04,608 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [625813259] [2022-03-15 18:51:04,608 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:51:04,612 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:51:04,645 INFO L252 McrAutomatonBuilder]: Finished intersection with 149 states and 355 transitions. [2022-03-15 18:51:04,646 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:51:06,082 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 18:51:06,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 18:51:06,082 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:51:06,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 18:51:06,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-03-15 18:51:06,083 INFO L87 Difference]: Start difference. First operand 521 states and 1735 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:51:06,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:51:06,170 INFO L93 Difference]: Finished difference Result 659 states and 2135 transitions. [2022-03-15 18:51:06,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 18:51:06,171 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 18:51:06,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:51:06,173 INFO L225 Difference]: With dead ends: 659 [2022-03-15 18:51:06,173 INFO L226 Difference]: Without dead ends: 659 [2022-03-15 18:51:06,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 163 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2022-03-15 18:51:06,174 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 90 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:51:06,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 0 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 18:51:06,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2022-03-15 18:51:06,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 567. [2022-03-15 18:51:06,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 566 states have (on average 3.335689045936396) internal successors, (1888), 566 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:51:06,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 1888 transitions. [2022-03-15 18:51:06,186 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 1888 transitions. Word has length 27 [2022-03-15 18:51:06,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:51:06,186 INFO L470 AbstractCegarLoop]: Abstraction has 567 states and 1888 transitions. [2022-03-15 18:51:06,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:51:06,186 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 1888 transitions. [2022-03-15 18:51:06,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 18:51:06,190 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:51:06,190 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:51:06,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 18:51:06,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:51:06,403 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:51:06,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:51:06,404 INFO L85 PathProgramCache]: Analyzing trace with hash 191767046, now seen corresponding path program 1 times [2022-03-15 18:51:06,405 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:51:06,405 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486282201] [2022-03-15 18:51:06,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:51:06,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:51:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:51:06,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:51:06,489 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:51:06,489 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486282201] [2022-03-15 18:51:06,489 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486282201] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:51:06,489 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042677301] [2022-03-15 18:51:06,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:51:06,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:51:06,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:51:06,491 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-03-15 18:51:06,491 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-03-15 18:51:06,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:51:06,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 18:51:06,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:51:06,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:51:06,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:51:06,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:51:06,866 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042677301] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 18:51:06,866 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 18:51:06,866 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 16 [2022-03-15 18:51:06,868 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [135049711] [2022-03-15 18:51:06,868 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:51:06,871 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:51:06,921 INFO L252 McrAutomatonBuilder]: Finished intersection with 189 states and 465 transitions. [2022-03-15 18:51:06,922 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:51:09,254 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [18447#(and (or (not (= ~res1~0 0)) (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (or (not (= (mod thread1Thread1of1ForFork1_~stop~0 256) 0)) (not (= ~n2~0 ~n1~0))))] [2022-03-15 18:51:09,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 18:51:09,254 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:51:09,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 18:51:09,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2022-03-15 18:51:09,255 INFO L87 Difference]: Start difference. First operand 567 states and 1888 transitions. Second operand has 9 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:51:09,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:51:09,402 INFO L93 Difference]: Finished difference Result 594 states and 1940 transitions. [2022-03-15 18:51:09,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 18:51:09,403 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 18:51:09,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:51:09,404 INFO L225 Difference]: With dead ends: 594 [2022-03-15 18:51:09,404 INFO L226 Difference]: Without dead ends: 348 [2022-03-15 18:51:09,404 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 201 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2022-03-15 18:51:09,405 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 177 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:51:09,405 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 7 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 18:51:09,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-03-15 18:51:09,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2022-03-15 18:51:09,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 347 states have (on average 3.3487031700288186) internal successors, (1162), 347 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:51:09,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1162 transitions. [2022-03-15 18:51:09,411 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1162 transitions. Word has length 27 [2022-03-15 18:51:09,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:51:09,411 INFO L470 AbstractCegarLoop]: Abstraction has 348 states and 1162 transitions. [2022-03-15 18:51:09,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:51:09,411 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1162 transitions. [2022-03-15 18:51:09,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 18:51:09,412 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:51:09,412 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:51:09,431 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-03-15 18:51:09,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-15 18:51:09,628 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:51:09,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:51:09,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1055576710, now seen corresponding path program 1 times [2022-03-15 18:51:09,629 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:51:09,630 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57315419] [2022-03-15 18:51:09,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:51:09,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:51:09,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:51:09,958 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:51:09,959 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:51:09,959 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57315419] [2022-03-15 18:51:09,959 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57315419] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:51:09,959 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235191350] [2022-03-15 18:51:09,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:51:09,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:51:09,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:51:09,960 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-03-15 18:51:09,961 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-03-15 18:51:10,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:51:10,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 51 conjunts are in the unsatisfiable core [2022-03-15 18:51:10,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:51:10,224 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 11 treesize of output 7 [2022-03-15 18:51:10,270 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 6 treesize of output 5 [2022-03-15 18:51:10,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 6 treesize of output 5 [2022-03-15 18:51:10,398 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 6 treesize of output 5 [2022-03-15 18:51:10,707 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:51:10,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:51:11,955 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_515 (Array Int Int)) (~get1~0.base Int) (~get2~0.base Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_515))) (let ((.cse0 (select .cse4 ~get2~0.base)) (.cse1 (select (select .cse4 c_~get3~0.base) c_~get3~0.offset)) (.cse3 (select .cse4 ~get1~0.base))) (or (and (< 0 c_~n2~0) (= (select .cse0 c_~get2~0.offset) .cse1) (< 0 c_~n3~0)) (not (let ((.cse2 (* c_thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse0 (+ c_~get2~0.offset .cse2)) (select .cse3 (+ .cse2 c_~get1~0.offset))))) (not (= .cse1 (select .cse3 c_~get1~0.offset))))))) is different from false [2022-03-15 18:51:12,121 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_515 (Array Int Int)) (~get1~0.base Int) (v_ArrVal_514 (Array Int Int)) (~get2~0.base Int)) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_515))) (let ((.cse2 (select .cse4 ~get1~0.base)) (.cse0 (select .cse4 ~get2~0.base)) (.cse3 (select (select .cse4 c_~get3~0.base) c_~get3~0.offset))) (or (not (let ((.cse1 (* c_thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse0 (+ c_~get2~0.offset .cse1)) (select .cse2 (+ .cse1 c_~get1~0.offset))))) (not (= .cse3 (select .cse2 c_~get1~0.offset))) (and (< 0 c_~n2~0) (< 0 c_~n3~0) (= (select .cse0 c_~get2~0.offset) .cse3)))))) is different from false [2022-03-15 18:51:12,175 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_515 (Array Int Int)) (~get1~0.base Int) (v_ArrVal_514 (Array Int Int)) (~get2~0.base Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_515))) (let ((.cse1 (select (select .cse0 ~get1~0.base) c_~get1~0.offset))) (or (not (= (select (select .cse0 ~get2~0.base) c_~get2~0.offset) .cse1)) (not (= (select (select .cse0 c_~get3~0.base) c_~get3~0.offset) .cse1)) (and (< 0 c_~n2~0) (< 0 c_~n3~0)))))) is different from false [2022-03-15 18:51:12,271 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:51:12,271 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 73 [2022-03-15 18:51:12,314 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:51:12,315 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 23661 treesize of output 22414 [2022-03-15 18:51:12,411 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:51:12,412 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22381 treesize of output 19845 [2022-03-15 18:51:12,517 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:51:12,518 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 19821 treesize of output 19205 [2022-03-15 18:51:12,617 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:51:12,618 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 19181 treesize of output 17925 [2022-03-15 18:51:17,774 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 1 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:51:17,775 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235191350] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:51:17,775 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:51:17,775 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 17] total 41 [2022-03-15 18:51:17,775 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1870088142] [2022-03-15 18:51:17,775 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:51:17,779 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:51:17,851 INFO L252 McrAutomatonBuilder]: Finished intersection with 229 states and 588 transitions. [2022-03-15 18:51:17,852 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:51:34,180 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 58 new interpolants: [19995#(and (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (<= 1 ~n2~0)) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (= (select (select |#memory_int| ~get2~0.base) 0) (select (select |#memory_int| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)))) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (= ~get3~0.offset 0)) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (= ~get2~0.offset 0)) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (= thread2Thread1of1ForFork2_~i~1 0))), 19980#(and (or (<= 1 ~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (= ~get2~0.offset 0) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (<= 1 ~n3~0) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (= ~get3~0.offset 0) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (= (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (= thread2Thread1of1ForFork2_~i~1 0) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (= thread3Thread1of1ForFork0_~i~2 0) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))))), 19960#(and (or (not (< 0 ~n2~0)) (= ~get3~0.offset 0) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)))) (or (not (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get3~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get3~0.offset)))) (<= ~n2~0 0) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)))) (or (not (< 0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (= thread2Thread1of1ForFork2_~i~1 0))), 19988#(and (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (not (< 0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (= thread2Thread1of1ForFork2_~i~1 0)) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (not (< 0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (= thread3Thread1of1ForFork0_~i~2 0)) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (not (< 0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (= ~get2~0.offset 0)) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (not (< 0 ~n2~0)) (= ~get3~0.offset 0) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))))), 19982#(and (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (= thread3Thread1of1ForFork0_~i~2 0) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (= ~get2~0.offset 0) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (= (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (= (select (select |#memory_int| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (<= 1 ~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (= ~get3~0.offset 0) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (= thread2Thread1of1ForFork2_~i~1 0) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))))), 20012#(and (or (= thread1Thread1of1ForFork1_~i~0 0) (not (< 0 ~n3~0))) (or (= ~get2~0.offset 0) (not (< 0 ~n3~0))) (or (= ~get3~0.offset 0) (not (< 0 ~n3~0))) (or (<= 1 ~n2~0) (not (< 0 ~n3~0))) (or (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get1~0.base) ~get1~0.offset)) (not (< 0 ~n3~0)))), 19966#(and (or (= ~get3~0.offset 0) (<= ~n3~0 0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get3~0.base) ~get3~0.offset))) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (not (< 0 ~n3~0)))), 20001#(and (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (= ~get2~0.offset 0) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (<= 1 ~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (= (select (select |#memory_int| ~get2~0.base) 0) (select (select |#memory_int| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset))) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (= thread2Thread1of1ForFork2_~i~1 0) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (= ~get3~0.offset 0) (<= ~n3~0 thread2Thread1of1ForFork2_~i~1) (<= ~n2~0 thread1Thread1of1ForFork1_~i~0) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))))), 19961#(and (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) (select (select |#memory_int| ~get3~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get3~0.offset))))) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (= ~get3~0.offset 0)) (or (= thread2Thread1of1ForFork2_~i~1 0) (<= ~n3~0 thread2Thread1of1ForFork2_~i~1))), 19975#(and (or (< 0 ~n3~0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= (select (select |#memory_int| ~get3~0.base) ~get3~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (or (< 0 ~n2~0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))))), 20010#(and (or (not (< 0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (= thread3Thread1of1ForFork0_~i~2 0) (not (< 0 ~n3~0))) (or (not (< 0 ~n2~0)) (= ~get3~0.offset 0) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (not (< 0 ~n3~0))) (or (not (< 0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (= ~get2~0.offset 0) (not (< 0 ~n3~0)))), 19968#(and (< thread3Thread1of1ForFork0_~i~2 ~n3~0) (= (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (< thread3Thread1of1ForFork0_~i~2 ~n2~0)), 20007#(and (or (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (< 0 ~n3~0)) (= (select (select |#memory_int| ~get3~0.base) ~get3~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (or (= ~get3~0.offset 0) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (< 0 ~n3~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (= ~get2~0.offset 0) (<= ~n3~0 0) (<= ~n2~0 thread1Thread1of1ForFork1_~i~0) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (<= 1 ~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (< 0 ~n3~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))))), 19956#(or (<= ~n2~0 thread1Thread1of1ForFork1_~i~0) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))), 19990#(and (or (= ~get2~0.offset 0) (not (< 0 ~n3~0))) (or (= ~get3~0.offset 0) (not (< 0 ~n3~0))) (or (<= 1 ~n2~0) (not (< 0 ~n3~0))) (or (= thread3Thread1of1ForFork0_~i~2 0) (not (< 0 ~n3~0))) (or (= (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (not (< 0 ~n3~0)))), 19978#(and (or (= (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (<= ~n2~0 thread1Thread1of1ForFork1_~i~0) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (< thread3Thread1of1ForFork0_~i~2 ~n3~0) (<= ~n2~0 thread1Thread1of1ForFork1_~i~0) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (< thread3Thread1of1ForFork0_~i~2 ~n2~0) (<= ~n2~0 thread1Thread1of1ForFork1_~i~0) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))))), 20003#(and (= ~get1~0.offset 0) (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset))) (<= 1 ~n2~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 0)), 19967#(and (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (<= 1 ~n2~0)) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (= thread3Thread1of1ForFork0_~i~2 0)) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (= (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (= (select (select |#memory_int| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (= ~get3~0.offset 0)) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (= ~get2~0.offset 0)) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (= thread2Thread1of1ForFork2_~i~1 0))), 19996#(and (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (<= 1 ~n2~0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (= ~get3~0.offset 0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (= ~get2~0.offset 0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (= (select (select |#memory_int| ~get2~0.base) 0) (select (select |#memory_int| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset))) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread2Thread1of1ForFork2_~i~1 0))), 19983#(and (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (= ~get2~0.offset 0) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (<= 1 ~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (= (select (select |#memory_int| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)) (= (select (select |#memory_int| ~get3~0.base) ~get3~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (= thread2Thread1of1ForFork2_~i~1 0) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (= ~get3~0.offset 0) (<= ~n3~0 thread2Thread1of1ForFork2_~i~1) (<= ~n2~0 thread1Thread1of1ForFork1_~i~0) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))))), 20006#(and (or (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (= thread3Thread1of1ForFork0_~i~2 0) (not (< 0 ~n3~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (= (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (< 0 ~n3~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (= ~get3~0.offset 0) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (< 0 ~n3~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (= ~get2~0.offset 0) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (< 0 ~n3~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (<= 1 ~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (< 0 ~n3~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))))), 19974#(and (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (<= 1 ~n2~0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (= ~get3~0.offset 0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread3Thread1of1ForFork0_~i~2 0)) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (= ~get2~0.offset 0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (= (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (= (select (select |#memory_int| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread2Thread1of1ForFork2_~i~1 0))), 19957#(or (<= ~n2~0 0) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)))), 20000#(and (or (<= 1 ~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (= ~get2~0.offset 0) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (<= 1 ~n3~0) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (= ~get3~0.offset 0) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get2~0.base) 0)) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (= thread2Thread1of1ForFork2_~i~1 0) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))))), 20011#(and (or (not (< 0 ~n2~0)) (= ~get3~0.offset 0) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (not (< 0 ~n3~0))) (or (not (< 0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (= ~get2~0.offset 0) (not (< 0 ~n3~0)))), 19992#(and (or (= ~get2~0.offset 0) (not (< 0 ~n3~0))) (or (= ~get3~0.offset 0) (not (< 0 ~n3~0))) (or (<= 1 ~n2~0) (not (< 0 ~n3~0))) (or (not (< 0 ~n3~0)) (= (select (select |#memory_int| ~get3~0.base) ~get3~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)) (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)))), 19986#(and (or (not (< 0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (= ~get2~0.offset 0)) (or (not (< 0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (= thread3Thread1of1ForFork0_~i~2 0)) (or (not (< 0 ~n2~0)) (= ~get3~0.offset 0) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)))) (or (= (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (not (< 0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (not (< 0 ~n2~0)) (<= 1 ~n3~0) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)))) (or (not (< 0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (= thread2Thread1of1ForFork2_~i~1 0))), 19965#(and (or (= ~get3~0.offset 0) (<= ~n3~0 0)) (or (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get3~0.base) ~get3~0.offset))) (not (< 0 ~n3~0)))), 20008#(and (or (= (select (select |#memory_int| ~get2~0.base) 0) (select (select |#memory_int| ~get1~0.base) ~get1~0.offset)) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (< 0 ~n3~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (= ~get3~0.offset 0) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (< 0 ~n3~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (= ~get2~0.offset 0) (<= ~n3~0 0) (<= ~n2~0 thread1Thread1of1ForFork1_~i~0) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (<= 1 ~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (< 0 ~n3~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))))), 19991#(and (or (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread3Thread1of1ForFork0_~i~2 0) (not (< 0 ~n3~0))) (or (<= 1 ~n2~0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (not (< 0 ~n3~0))) (or (= ~get3~0.offset 0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (not (< 0 ~n3~0))) (or (= ~get2~0.offset 0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (not (< 0 ~n3~0))) (or (= (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (not (< 0 ~n3~0)))), 19964#(and (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (not (< 0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (= thread2Thread1of1ForFork2_~i~1 0)) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (<= ~n2~0 0) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (not (= (select (select |#memory_int| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) (select (select |#memory_int| ~get3~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get3~0.offset))))) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (not (< 0 ~n2~0)) (= ~get3~0.offset 0) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))))), 19994#(and (or (= ~get3~0.offset 0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread2Thread1of1ForFork2_~i~1 0)) (or (<= 1 ~n3~0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (<= 1 ~n2~0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (= ~get2~0.offset 0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get2~0.base) 0)) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))))), 19976#(and (or (= ~get3~0.offset 0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread2Thread1of1ForFork2_~i~1 0)) (or (<= 1 ~n3~0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (<= 1 ~n2~0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)) (= (select (select |#memory_int| ~get3~0.base) ~get3~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (or (= ~get2~0.offset 0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))))), 19998#(and (or (<= 1 ~n2~0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (not (< 0 ~n3~0))) (or (= ~get3~0.offset 0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (not (< 0 ~n3~0))) (or (= ~get2~0.offset 0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (not (< 0 ~n3~0))) (or (= (select (select |#memory_int| ~get2~0.base) 0) (select (select |#memory_int| ~get1~0.base) ~get1~0.offset)) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (not (< 0 ~n3~0)))), 19989#(and (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (not (< 0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (= thread2Thread1of1ForFork2_~i~1 0)) (or (<= ~n2~0 0) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (= ~get2~0.offset 0) (<= ~n3~0 thread2Thread1of1ForFork2_~i~1)) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (not (< 0 ~n2~0)) (= ~get3~0.offset 0) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))))), 19999#(and (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (<= 1 ~n2~0)) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (= (select (select |#memory_int| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) |thread1Thread1of1ForFork1_#t~mem2|)) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (= ~get3~0.offset 0)) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (= ~get2~0.offset 0)) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (= thread1Thread1of1ForFork1_~i~0 0)) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (= thread2Thread1of1ForFork2_~i~1 0))), 19969#(and (< 0 ~n3~0) (< 0 ~n2~0) (= (select (select |#memory_int| ~get3~0.base) ~get3~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))), 19963#(and (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) (select (select |#memory_int| ~get3~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get3~0.offset)))) (<= ~n2~0 thread1Thread1of1ForFork1_~i~0) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (= thread2Thread1of1ForFork2_~i~1 0) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (= ~get3~0.offset 0) (<= ~n3~0 thread2Thread1of1ForFork2_~i~1) (<= ~n2~0 thread1Thread1of1ForFork1_~i~0) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))))), 19981#(and (or (<= 1 ~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (= ~get2~0.offset 0) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (<= 1 ~n3~0) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (= ~get3~0.offset 0) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)) (= (select (select |#memory_int| ~get3~0.base) ~get3~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (= thread2Thread1of1ForFork2_~i~1 0) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))))), 19997#(and (or (= ~get2~0.offset 0) (not (< 0 ~n3~0))) (or (= ~get3~0.offset 0) (not (< 0 ~n3~0))) (or (<= 1 ~n2~0) (not (< 0 ~n3~0))) (or (= (select (select |#memory_int| ~get2~0.base) 0) (select (select |#memory_int| ~get1~0.base) ~get1~0.offset)) (not (< 0 ~n3~0)))), 19985#(and (or (< 0 ~n3~0) (<= ~n2~0 0) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)))) (or (<= ~n2~0 0) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (= (select (select |#memory_int| ~get3~0.base) ~get3~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)))), 19979#(and (or (< 0 ~n2~0) (<= ~n2~0 thread1Thread1of1ForFork1_~i~0) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (< 0 ~n3~0) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (= (select (select |#memory_int| ~get3~0.base) ~get3~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))))), 20004#(and (= ~get1~0.offset 0) (<= 1 ~n2~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 0)), 19955#(not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))), 19971#(and (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (<= 1 ~n2~0)) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (= (select (select |#memory_int| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)) (= (select (select |#memory_int| ~get3~0.base) ~get3~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (= ~get3~0.offset 0)) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (= ~get2~0.offset 0)) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (= thread2Thread1of1ForFork2_~i~1 0))), 20009#(and (or (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get3~0.base) ~get3~0.offset))) (<= ~n2~0 0) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (<= ~n3~0 0)) (or (not (< 0 ~n2~0)) (= ~get3~0.offset 0) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (<= ~n3~0 0))), 19993#(and (or (<= 1 ~n2~0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (not (< 0 ~n3~0))) (or (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (not (< 0 ~n3~0)) (= (select (select |#memory_int| ~get3~0.base) ~get3~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)) (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (or (= ~get3~0.offset 0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (not (< 0 ~n3~0))) (or (= ~get2~0.offset 0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (not (< 0 ~n3~0)))), 20002#(and (or (not (< 0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (= ~get2~0.offset 0)) (or (not (< 0 ~n2~0)) (= ~get3~0.offset 0) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)))) (or (not (< 0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get2~0.base) 0))) (or (not (< 0 ~n2~0)) (<= 1 ~n3~0) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)))) (or (not (< 0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (= thread2Thread1of1ForFork2_~i~1 0))), 20005#(and (or (= ~get3~0.offset 0) (<= ~n3~0 0) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get3~0.base) ~get3~0.offset))) (<= ~n3~0 0) (<= ~n2~0 thread1Thread1of1ForFork1_~i~0) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))))), 19962#(and (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (= ~get3~0.offset 0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread2Thread1of1ForFork2_~i~1 0) (<= ~n3~0 thread2Thread1of1ForFork2_~i~1)) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) (select (select |#memory_int| ~get3~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get3~0.offset)))) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))))), 19984#(and (or (= (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (<= ~n2~0 0) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)))) (or (<= ~n2~0 0) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (< thread3Thread1of1ForFork0_~i~2 ~n2~0)) (or (< thread3Thread1of1ForFork0_~i~2 ~n3~0) (<= ~n2~0 0) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))))), 19958#(and (or (= ~get3~0.offset 0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread2Thread1of1ForFork2_~i~1 0)) (or (not (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get3~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get3~0.offset)))) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))))), 19987#(and (or (not (< 0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (= ~get2~0.offset 0)) (or (not (< 0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)) (= (select (select |#memory_int| ~get3~0.base) ~get3~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (or (not (< 0 ~n2~0)) (= ~get3~0.offset 0) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)))) (or (not (< 0 ~n2~0)) (<= 1 ~n3~0) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)))) (or (not (< 0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (= thread2Thread1of1ForFork2_~i~1 0))), 19972#(and (or (= (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (< thread3Thread1of1ForFork0_~i~2 ~n3~0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (< thread3Thread1of1ForFork0_~i~2 ~n2~0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))))), 19959#(and (or (not (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get3~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get3~0.offset)))) (<= ~n2~0 thread1Thread1of1ForFork1_~i~0) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (= ~get3~0.offset 0) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (= thread2Thread1of1ForFork2_~i~1 0) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))))), 19973#(and (or (= ~get3~0.offset 0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread2Thread1of1ForFork2_~i~1 0)) (or (= (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (<= 1 ~n3~0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread3Thread1of1ForFork0_~i~2 0)) (or (<= 1 ~n2~0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (= ~get2~0.offset 0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))))), 19970#(and (or (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)) (= (select (select |#memory_int| ~get3~0.base) ~get3~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (<= 1 ~n2~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 0)), 19977#(and (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (<= 1 ~n2~0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (= ~get3~0.offset 0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (= ~get2~0.offset 0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= (select (select |#memory_int| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)) (= (select (select |#memory_int| ~get3~0.base) ~get3~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (or (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread2Thread1of1ForFork2_~i~1 0)))] [2022-03-15 18:51:34,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-03-15 18:51:34,181 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:51:34,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-03-15 18:51:34,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=583, Invalid=8538, Unknown=11, NotChecked=570, Total=9702 [2022-03-15 18:51:34,183 INFO L87 Difference]: Start difference. First operand 348 states and 1162 transitions. Second operand has 73 states, 73 states have (on average 3.9863013698630136) internal successors, (291), 72 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:51:51,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:51:51,478 INFO L93 Difference]: Finished difference Result 2889 states and 9744 transitions. [2022-03-15 18:51:51,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-03-15 18:51:51,478 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 3.9863013698630136) internal successors, (291), 72 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-03-15 18:51:51,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:51:51,490 INFO L225 Difference]: With dead ends: 2889 [2022-03-15 18:51:51,490 INFO L226 Difference]: Without dead ends: 2801 [2022-03-15 18:51:51,495 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 167 SyntacticMatches, 5 SemanticMatches, 180 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 8182 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=3702, Invalid=28161, Unknown=11, NotChecked=1068, Total=32942 [2022-03-15 18:51:51,495 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1867 mSDsluCounter, 3444 mSDsCounter, 0 mSdLazyCounter, 20851 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1867 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 21183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 20851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:51:51,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1867 Valid, 0 Invalid, 21183 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [332 Valid, 20851 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2022-03-15 18:51:51,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2801 states. [2022-03-15 18:51:51,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2801 to 780. [2022-03-15 18:51:51,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 779 states have (on average 3.410783055198973) internal successors, (2657), 779 states have internal predecessors, (2657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:51:51,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 2657 transitions. [2022-03-15 18:51:51,522 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 2657 transitions. Word has length 29 [2022-03-15 18:51:51,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:51:51,523 INFO L470 AbstractCegarLoop]: Abstraction has 780 states and 2657 transitions. [2022-03-15 18:51:51,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 3.9863013698630136) internal successors, (291), 72 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:51:51,523 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 2657 transitions. [2022-03-15 18:51:51,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 18:51:51,525 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:51:51,525 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:51:51,541 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-03-15 18:51:51,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:51:51,741 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:51:51,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:51:51,742 INFO L85 PathProgramCache]: Analyzing trace with hash 985424488, now seen corresponding path program 2 times [2022-03-15 18:51:51,742 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:51:51,742 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473204618] [2022-03-15 18:51:51,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:51:51,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:51:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:51:52,169 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:51:52,170 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:51:52,170 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473204618] [2022-03-15 18:51:52,170 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473204618] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:51:52,170 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407259874] [2022-03-15 18:51:52,170 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 18:51:52,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:51:52,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:51:52,171 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-03-15 18:51:52,171 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-03-15 18:51:52,285 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 18:51:52,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:51:52,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 42 conjunts are in the unsatisfiable core [2022-03-15 18:51:52,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:51:52,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:51:52,656 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 18 treesize of output 20 [2022-03-15 18:51:52,919 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:51:52,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:51:53,554 WARN L838 $PredicateComparison]: unable to prove that (forall ((~get3~0.base Int) (~get2~0.base Int) (v_ArrVal_576 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_576))) (let ((.cse1 (select .cse2 ~get2~0.base)) (.cse0 (select .cse2 ~get3~0.base))) (or (and (< 0 c_~n2~0) (< 0 c_~n3~0) (= (select .cse0 c_~get3~0.offset) (select .cse1 c_~get2~0.offset))) (not (let ((.cse3 (* c_thread1Thread1of1ForFork1_~i~0 4))) (= (select (select .cse2 c_~get1~0.base) (+ .cse3 c_~get1~0.offset)) (select .cse1 (+ c_~get2~0.offset .cse3))))) (not (= |c_thread2Thread1of1ForFork2_#t~mem9| (select .cse0 (+ c_~get3~0.offset (* c_thread2Thread1of1ForFork2_~i~1 4))))))))) is different from false [2022-03-15 18:51:53,647 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:51:53,647 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 224 treesize of output 388 [2022-03-15 18:51:53,702 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:51:53,703 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 152 treesize of output 242 [2022-03-15 18:53:58,915 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:53:58,915 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407259874] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:53:58,915 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:53:58,915 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 14] total 40 [2022-03-15 18:53:58,915 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [933848417] [2022-03-15 18:53:58,916 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:58,919 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:58,959 INFO L252 McrAutomatonBuilder]: Finished intersection with 149 states and 351 transitions. [2022-03-15 18:53:58,959 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:54:05,190 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [24846#(and (or (= (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (<= ~n2~0 0) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)))) (or (<= ~n2~0 0) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (< thread3Thread1of1ForFork0_~i~2 ~n2~0)) (or (< thread3Thread1of1ForFork0_~i~2 ~n3~0) (<= ~n2~0 0) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))))), 24854#(and (or (<= 1 ~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (= ~get2~0.offset 0) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (<= 1 ~n3~0) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (= ~get3~0.offset 0) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)) (= (select (select |#memory_int| ~get3~0.base) ~get3~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (= thread2Thread1of1ForFork2_~i~1 0) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))))), 24857#(and (or (not (< 0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (= ~get2~0.offset 0)) (or (not (< 0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)) (= (select (select |#memory_int| ~get3~0.base) ~get3~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (or (not (< 0 ~n2~0)) (= ~get3~0.offset 0) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)))) (or (not (< 0 ~n2~0)) (<= 1 ~n3~0) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)))) (or (not (< 0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (= thread2Thread1of1ForFork2_~i~1 0))), 24842#(or (<= ~n2~0 thread1Thread1of1ForFork1_~i~0) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))), 24839#(and (or (= (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (< thread3Thread1of1ForFork0_~i~2 ~n3~0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (< thread3Thread1of1ForFork0_~i~2 ~n2~0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))))), 24852#(and (or (not (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get3~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get3~0.offset)))) (<= ~n2~0 thread1Thread1of1ForFork1_~i~0) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (= ~get3~0.offset 0) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (= thread2Thread1of1ForFork2_~i~1 0) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))))), 24853#(and (or (<= 1 ~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (= ~get2~0.offset 0) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (<= 1 ~n3~0) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (= ~get3~0.offset 0) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (= (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (= thread2Thread1of1ForFork2_~i~1 0) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (= thread3Thread1of1ForFork0_~i~2 0) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))))), 24858#(and (or (= ~get3~0.offset 0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread2Thread1of1ForFork2_~i~1 0)) (or (<= 1 ~n3~0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (<= 1 ~n2~0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (= ~get2~0.offset 0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get2~0.base) 0)) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))))), 24861#(and (= ~get1~0.offset 0) (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get1~0.base) ~get1~0.offset)) (<= 1 ~n2~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 0)), 24848#(and (or (= ~get3~0.offset 0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread2Thread1of1ForFork2_~i~1 0)) (or (not (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get3~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get3~0.offset)))) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))))), 24851#(and (or (= ~get3~0.offset 0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread2Thread1of1ForFork2_~i~1 0)) (or (<= 1 ~n3~0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (<= 1 ~n2~0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)) (= (select (select |#memory_int| ~get3~0.base) ~get3~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (or (= ~get2~0.offset 0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))))), 24850#(and (or (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)) (= (select (select |#memory_int| ~get3~0.base) ~get3~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (<= 1 ~n2~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 0)), 24838#(and (< thread3Thread1of1ForFork0_~i~2 ~n3~0) (= (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (< thread3Thread1of1ForFork0_~i~2 ~n2~0)), 24843#(and (or (= (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (<= ~n2~0 thread1Thread1of1ForFork1_~i~0) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (< thread3Thread1of1ForFork0_~i~2 ~n3~0) (<= ~n2~0 thread1Thread1of1ForFork1_~i~0) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (< thread3Thread1of1ForFork0_~i~2 ~n2~0) (<= ~n2~0 thread1Thread1of1ForFork1_~i~0) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))))), 24841#(and (or (< 0 ~n3~0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= (select (select |#memory_int| ~get3~0.base) ~get3~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (or (< 0 ~n2~0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))))), 24845#(or (<= ~n2~0 0) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)))), 24847#(and (or (< 0 ~n3~0) (<= ~n2~0 0) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)))) (or (<= ~n2~0 0) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (= (select (select |#memory_int| ~get3~0.base) ~get3~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)))), 24849#(and (or (= ~get3~0.offset 0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread2Thread1of1ForFork2_~i~1 0)) (or (= (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (<= 1 ~n3~0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread3Thread1of1ForFork0_~i~2 0)) (or (<= 1 ~n2~0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (= ~get2~0.offset 0) (not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))))), 24862#(and (= ~get1~0.offset 0) (<= 1 ~n2~0) (<= 1 ~n3~0) (= ~get3~0.offset 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~get2~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 0)), 24855#(and (or (not (< 0 ~n2~0)) (= ~get3~0.offset 0) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)))) (or (not (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get3~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get3~0.offset)))) (<= ~n2~0 0) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)))) (or (not (< 0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (= thread2Thread1of1ForFork2_~i~1 0))), 24840#(and (< 0 ~n3~0) (< 0 ~n2~0) (= (select (select |#memory_int| ~get3~0.base) ~get3~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))), 24844#(and (or (< 0 ~n2~0) (<= ~n2~0 thread1Thread1of1ForFork1_~i~0) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (< 0 ~n3~0) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (= (select (select |#memory_int| ~get3~0.base) ~get3~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))))), 24837#(not (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))), 24859#(and (or (<= 1 ~n2~0) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (= ~get2~0.offset 0) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (<= 1 ~n3~0) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (= ~get3~0.offset 0) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get2~0.base) 0)) (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (not (< thread1Thread1of1ForFork1_~i~0 ~n2~0)) (= thread2Thread1of1ForFork2_~i~1 0) (not (= (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))))), 24860#(and (or (not (< 0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (= ~get2~0.offset 0)) (or (not (< 0 ~n2~0)) (= ~get3~0.offset 0) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)))) (or (not (< 0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get2~0.base) 0))) (or (not (< 0 ~n2~0)) (<= 1 ~n3~0) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)))) (or (not (< 0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (= thread2Thread1of1ForFork2_~i~1 0))), 24856#(and (or (not (< 0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (= ~get2~0.offset 0)) (or (not (< 0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (= thread3Thread1of1ForFork0_~i~2 0)) (or (not (< 0 ~n2~0)) (= ~get3~0.offset 0) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)))) (or (= (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (not (< 0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (not (< 0 ~n2~0)) (<= 1 ~n3~0) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)))) (or (not (< 0 ~n2~0)) (not (= (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (= thread2Thread1of1ForFork2_~i~1 0)))] [2022-03-15 18:54:05,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-15 18:54:05,191 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:54:05,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-15 18:54:05,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=3949, Unknown=1, NotChecked=128, Total=4422 [2022-03-15 18:54:05,192 INFO L87 Difference]: Start difference. First operand 780 states and 2657 transitions. Second operand has 42 states, 42 states have (on average 3.619047619047619) internal successors, (152), 40 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:09,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:54:09,726 INFO L93 Difference]: Finished difference Result 2422 states and 8428 transitions. [2022-03-15 18:54:09,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-03-15 18:54:09,727 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.619047619047619) internal successors, (152), 40 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-03-15 18:54:09,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:54:09,738 INFO L225 Difference]: With dead ends: 2422 [2022-03-15 18:54:09,738 INFO L226 Difference]: Without dead ends: 2356 [2022-03-15 18:54:09,741 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 121 SyntacticMatches, 3 SemanticMatches, 99 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2081 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1179, Invalid=8724, Unknown=1, NotChecked=196, Total=10100 [2022-03-15 18:54:09,741 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 548 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 5671 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 5671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-15 18:54:09,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [548 Valid, 0 Invalid, 5770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 5671 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-03-15 18:54:09,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2356 states. [2022-03-15 18:54:09,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2356 to 790. [2022-03-15 18:54:09,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 789 states have (on average 3.428390367553866) internal successors, (2705), 789 states have internal predecessors, (2705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:09,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 2705 transitions. [2022-03-15 18:54:09,766 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 2705 transitions. Word has length 29 [2022-03-15 18:54:09,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:54:09,766 INFO L470 AbstractCegarLoop]: Abstraction has 790 states and 2705 transitions. [2022-03-15 18:54:09,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.619047619047619) internal successors, (152), 40 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:09,766 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 2705 transitions. [2022-03-15 18:54:09,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 18:54:09,768 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:54:09,768 INFO L514 BasicCegarLoop]: 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] [2022-03-15 18:54:09,786 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-03-15 18:54:09,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:54:09,982 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:54:09,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:54:09,983 INFO L85 PathProgramCache]: Analyzing trace with hash 318300800, now seen corresponding path program 3 times [2022-03-15 18:54:09,984 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:54:09,984 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273305000] [2022-03-15 18:54:09,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:54:09,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:54:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:10,567 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:54:10,567 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:54:10,568 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273305000] [2022-03-15 18:54:10,568 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273305000] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:54:10,568 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154413324] [2022-03-15 18:54:10,568 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 18:54:10,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:54:10,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:54:10,569 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-03-15 18:54:10,569 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-03-15 18:54:10,680 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 18:54:10,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:54:10,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-15 18:54:10,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:54:10,852 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 11 treesize of output 7 [2022-03-15 18:54:10,907 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 6 treesize of output 5 [2022-03-15 18:54:11,027 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 6 treesize of output 5 [2022-03-15 18:54:11,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:54:11,294 INFO L353 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-03-15 18:54:11,294 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 34 [2022-03-15 18:54:11,303 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 18:54:11,304 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2022-03-15 18:54:11,510 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:54:11,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:54:11,665 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_641 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_641))) (let ((.cse0 (select .cse1 c_~get3~0.base))) (or (not (= |c_thread2Thread1of1ForFork2_#t~mem9| (select .cse0 (+ c_~get3~0.offset (* c_thread2Thread1of1ForFork2_~i~1 4))))) (and (= (select (select .cse1 c_~get2~0.base) c_~get2~0.offset) (select .cse0 c_~get3~0.offset)) (< 0 c_~n2~0) (< 0 c_~n3~0)))))) is different from false [2022-03-15 18:54:11,927 WARN L838 $PredicateComparison]: unable to prove that (forall ((~get1~0.base Int) (v_ArrVal_641 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_641))) (let ((.cse0 (select |c_#memory_int| ~get1~0.base)) (.cse2 (select (select .cse3 c_~get3~0.base) c_~get3~0.offset))) (or (not (let ((.cse1 (* c_thread1Thread1of1ForFork1_~i~0 4))) (= (select .cse0 (+ .cse1 c_~get1~0.offset)) (select (select |c_#memory_int| c_~get2~0.base) (+ c_~get2~0.offset .cse1))))) (not (= (select .cse0 c_~get1~0.offset) .cse2)) (and (= (select (select .cse3 c_~get2~0.base) c_~get2~0.offset) .cse2) (< 0 c_~n2~0) (< 0 c_~n3~0)))))) is different from false [2022-03-15 18:54:12,053 WARN L838 $PredicateComparison]: unable to prove that (forall ((~get1~0.base Int) (v_ArrVal_641 (Array Int Int)) (v_ArrVal_640 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_640))) (let ((.cse4 (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_641))) (let ((.cse0 (select .cse2 ~get1~0.base)) (.cse1 (select (select .cse4 c_~get3~0.base) c_~get3~0.offset))) (or (not (= (select .cse0 c_~get1~0.offset) .cse1)) (not (let ((.cse3 (* c_thread1Thread1of1ForFork1_~i~0 4))) (= (select (select .cse2 c_~get2~0.base) (+ c_~get2~0.offset .cse3)) (select .cse0 (+ .cse3 c_~get1~0.offset))))) (and (< 0 c_~n2~0) (< 0 c_~n3~0) (= (select (select .cse4 c_~get2~0.base) c_~get2~0.offset) .cse1))))))) is different from false [2022-03-15 18:54:12,114 WARN L838 $PredicateComparison]: unable to prove that (forall ((~get1~0.base Int) (v_ArrVal_641 (Array Int Int)) (v_ArrVal_640 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_640))) (let ((.cse3 (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_641))) (let ((.cse0 (select (select .cse1 ~get1~0.base) c_~get1~0.offset)) (.cse2 (select (select .cse3 c_~get3~0.base) c_~get3~0.offset))) (or (not (= .cse0 (select (select .cse1 c_~get2~0.base) c_~get2~0.offset))) (not (= .cse0 .cse2)) (and (< 0 c_~n2~0) (< 0 c_~n3~0) (= (select (select .cse3 c_~get2~0.base) c_~get2~0.offset) .cse2))))))) is different from false [2022-03-15 18:54:12,240 WARN L838 $PredicateComparison]: unable to prove that (forall ((~get1~0.base Int) (v_ArrVal_639 (Array Int Int)) (v_ArrVal_641 (Array Int Int)) (v_ArrVal_640 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_639) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_640))) (let ((.cse2 (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_641))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse0 (select (select .cse3 ~get1~0.base) c_~get1~0.offset))) (or (not (= .cse0 .cse1)) (and (< 0 c_~n2~0) (< 0 c_~n3~0) (= (select (select .cse2 c_~get2~0.base) c_~get2~0.offset) .cse1)) (not (= .cse0 (select (select .cse3 c_~get2~0.base) c_~get2~0.offset)))))))) is different from false [2022-03-15 18:54:12,253 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:54:12,253 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 100 [2022-03-15 18:54:12,285 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:54:12,286 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28714 treesize of output 26827 [2022-03-15 18:54:12,412 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:54:12,413 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26794 treesize of output 25858 [2022-03-15 18:54:12,553 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:54:12,554 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 24820 treesize of output 22268 [2022-03-15 18:54:12,686 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:54:12,687 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 23274 treesize of output 21378 [2022-03-15 18:54:12,805 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-03-15 18:54:12,827 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-03-15 18:54:13,019 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,SelfDestructingSolverStorable14 [2022-03-15 18:54:13,020 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-03-15 18:54:13,023 INFO L158 Benchmark]: Toolchain (without parser) took 301066.09ms. Allocated memory was 200.3MB in the beginning and 744.5MB in the end (delta: 544.2MB). Free memory was 143.9MB in the beginning and 205.0MB in the end (delta: -61.0MB). Peak memory consumption was 579.2MB. Max. memory is 8.0GB. [2022-03-15 18:54:13,023 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 200.3MB. Free memory is still 160.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 18:54:13,023 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.15ms. Allocated memory was 200.3MB in the beginning and 297.8MB in the end (delta: 97.5MB). Free memory was 143.7MB in the beginning and 267.6MB in the end (delta: -123.9MB). Peak memory consumption was 7.5MB. Max. memory is 8.0GB. [2022-03-15 18:54:13,023 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.16ms. Allocated memory is still 297.8MB. Free memory was 267.1MB in the beginning and 264.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 18:54:13,024 INFO L158 Benchmark]: Boogie Preprocessor took 20.90ms. Allocated memory is still 297.8MB. Free memory was 264.7MB in the beginning and 262.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 18:54:13,024 INFO L158 Benchmark]: RCFGBuilder took 562.68ms. Allocated memory is still 297.8MB. Free memory was 262.9MB in the beginning and 239.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-03-15 18:54:13,024 INFO L158 Benchmark]: TraceAbstraction took 300240.48ms. Allocated memory was 297.8MB in the beginning and 744.5MB in the end (delta: 446.7MB). Free memory was 239.3MB in the beginning and 205.0MB in the end (delta: 34.3MB). Peak memory consumption was 577.7MB. Max. memory is 8.0GB. [2022-03-15 18:54:13,025 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.11ms. Allocated memory is still 200.3MB. Free memory is still 160.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 203.15ms. Allocated memory was 200.3MB in the beginning and 297.8MB in the end (delta: 97.5MB). Free memory was 143.7MB in the beginning and 267.6MB in the end (delta: -123.9MB). Peak memory consumption was 7.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.16ms. Allocated memory is still 297.8MB. Free memory was 267.1MB in the beginning and 264.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.90ms. Allocated memory is still 297.8MB. Free memory was 264.7MB in the beginning and 262.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 562.68ms. Allocated memory is still 297.8MB. Free memory was 262.9MB in the beginning and 239.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 300240.48ms. Allocated memory was 297.8MB in the beginning and 744.5MB in the end (delta: 446.7MB). Free memory was 239.3MB in the beginning and 205.0MB in the end (delta: 34.3MB). Peak memory consumption was 577.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.2s, 315 PlacesBefore, 42 PlacesAfterwards, 340 TransitionsBefore, 43 TransitionsAfterwards, 12480 CoEnabledTransitionPairs, 7 FixpointIterations, 182 TrivialSequentialCompositions, 102 ConcurrentSequentialCompositions, 28 TrivialYvCompositions, 35 ConcurrentYvCompositions, 24 ChoiceCompositions, 371 TotalNumberOfCompositions, 14919 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12446, positive: 12295, positive conditional: 0, positive unconditional: 12295, negative: 151, negative conditional: 0, negative unconditional: 151, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 7210, positive: 7165, positive conditional: 0, positive unconditional: 7165, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 12446, positive: 5130, positive conditional: 0, positive unconditional: 5130, negative: 106, negative conditional: 0, negative unconditional: 106, unknown: 7210, unknown conditional: 0, unknown unconditional: 7210] , Statistics on independence cache: Total cache size (in pairs): 174, Positive cache size: 163, Positive conditional cache size: 0, Positive unconditional cache size: 163, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-03-15 18:54:13,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...