/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/popl20-threaded-sum-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 19:45:08,840 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 19:45:08,841 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 19:45:08,891 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 19:45:08,891 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 19:45:08,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 19:45:08,893 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 19:45:08,894 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 19:45:08,895 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 19:45:08,896 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 19:45:08,896 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 19:45:08,897 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 19:45:08,897 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 19:45:08,898 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 19:45:08,898 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 19:45:08,899 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 19:45:08,900 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 19:45:08,900 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 19:45:08,901 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 19:45:08,902 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 19:45:08,919 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 19:45:08,920 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 19:45:08,921 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 19:45:08,921 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 19:45:08,923 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 19:45:08,923 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 19:45:08,923 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 19:45:08,924 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 19:45:08,924 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 19:45:08,925 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 19:45:08,925 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 19:45:08,925 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 19:45:08,926 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 19:45:08,926 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 19:45:08,927 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 19:45:08,927 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 19:45:08,927 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 19:45:08,928 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 19:45:08,928 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 19:45:08,928 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 19:45:08,928 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 19:45:08,935 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 19:45:08,949 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 19:45:08,950 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 19:45:08,950 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 19:45:08,950 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 19:45:08,951 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 19:45:08,951 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 19:45:08,954 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 19:45:08,954 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 19:45:08,954 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 19:45:08,955 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 19:45:08,955 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 19:45:08,955 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 19:45:08,955 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 19:45:08,956 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 19:45:08,956 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 19:45:08,956 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 19:45:08,956 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 19:45:08,956 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 19:45:08,956 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 19:45:08,956 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 19:45:08,956 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 19:45:08,956 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 19:45:08,957 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 19:45:08,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:45:08,957 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 19:45:08,957 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 19:45:08,957 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 19:45:08,957 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 19:45:08,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 19:45:08,957 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 19:45:08,958 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 19:45:08,958 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 19:45:08,958 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 19:45:09,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 19:45:09,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 19:45:09,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 19:45:09,131 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 19:45:09,131 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 19:45:09,132 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-threaded-sum-3.wvr.c [2022-03-15 19:45:09,185 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a2c10f6e/288137456c2f4b799d6bb14bef9e6e44/FLAG6054a8772 [2022-03-15 19:45:09,546 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 19:45:09,546 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-threaded-sum-3.wvr.c [2022-03-15 19:45:09,555 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a2c10f6e/288137456c2f4b799d6bb14bef9e6e44/FLAG6054a8772 [2022-03-15 19:45:09,978 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a2c10f6e/288137456c2f4b799d6bb14bef9e6e44 [2022-03-15 19:45:09,980 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 19:45:09,981 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 19:45:09,982 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 19:45:09,982 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 19:45:09,984 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 19:45:09,984 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:45:09" (1/1) ... [2022-03-15 19:45:09,985 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dbc6210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:45:09, skipping insertion in model container [2022-03-15 19:45:09,985 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:45:09" (1/1) ... [2022-03-15 19:45:09,998 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 19:45:10,011 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 19:45:10,202 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/popl20-threaded-sum-3.wvr.c[2957,2970] [2022-03-15 19:45:10,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:45:10,214 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 19:45:10,248 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/popl20-threaded-sum-3.wvr.c[2957,2970] [2022-03-15 19:45:10,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:45:10,257 INFO L208 MainTranslator]: Completed translation [2022-03-15 19:45:10,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:45:10 WrapperNode [2022-03-15 19:45:10,257 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 19:45:10,258 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 19:45:10,258 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 19:45:10,258 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 19:45:10,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:45:10" (1/1) ... [2022-03-15 19:45:10,276 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:45:10" (1/1) ... [2022-03-15 19:45:10,294 INFO L137 Inliner]: procedures = 22, calls = 46, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2022-03-15 19:45:10,295 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 19:45:10,295 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 19:45:10,296 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 19:45:10,296 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 19:45:10,301 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:45:10" (1/1) ... [2022-03-15 19:45:10,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:45:10" (1/1) ... [2022-03-15 19:45:10,311 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:45:10" (1/1) ... [2022-03-15 19:45:10,311 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:45:10" (1/1) ... [2022-03-15 19:45:10,320 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:45:10" (1/1) ... [2022-03-15 19:45:10,322 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:45:10" (1/1) ... [2022-03-15 19:45:10,323 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:45:10" (1/1) ... [2022-03-15 19:45:10,324 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 19:45:10,325 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 19:45:10,325 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 19:45:10,325 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 19:45:10,330 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:45:10" (1/1) ... [2022-03-15 19:45:10,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:45:10,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:10,380 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 19:45:10,402 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 19:45:10,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 19:45:10,412 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 19:45:10,412 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 19:45:10,412 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 19:45:10,413 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 19:45:10,413 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 19:45:10,413 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 19:45:10,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 19:45:10,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 19:45:10,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 19:45:10,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 19:45:10,414 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 19:45:10,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 19:45:10,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 19:45:10,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 19:45:10,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 19:45:10,415 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 19:45:10,484 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 19:45:10,486 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 19:45:10,644 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 19:45:10,690 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 19:45:10,695 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-15 19:45:10,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:45:10 BoogieIcfgContainer [2022-03-15 19:45:10,697 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 19:45:10,700 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 19:45:10,700 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 19:45:10,703 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 19:45:10,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 07:45:09" (1/3) ... [2022-03-15 19:45:10,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb063af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:45:10, skipping insertion in model container [2022-03-15 19:45:10,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:45:10" (2/3) ... [2022-03-15 19:45:10,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb063af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:45:10, skipping insertion in model container [2022-03-15 19:45:10,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:45:10" (3/3) ... [2022-03-15 19:45:10,705 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-threaded-sum-3.wvr.c [2022-03-15 19:45:10,709 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 19:45:10,709 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 19:45:10,709 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 19:45:10,710 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 19:45:10,752 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,753 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,754 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,754 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,754 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,754 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,754 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,754 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,754 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,755 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,755 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,755 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,755 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,755 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,755 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,755 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,755 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,756 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,756 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,756 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,757 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,757 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,757 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,757 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,758 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,758 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,758 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,758 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,758 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,758 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,758 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,758 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,758 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,759 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,759 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,759 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,759 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,759 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,760 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,760 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,760 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~cond~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,760 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~cond~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,761 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~cond~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,761 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~cond~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,761 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~cond~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,761 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~cond~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,761 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,761 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,762 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,762 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,762 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,762 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,762 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,762 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,762 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~cond~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,762 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~cond~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,765 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,765 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,765 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,765 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,765 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~cond~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,766 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~cond~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,766 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,766 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,766 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,766 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,767 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,767 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,767 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,767 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,767 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:45:10,770 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 19:45:10,804 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 19:45:10,809 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 19:45:10,810 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 19:45:10,817 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 19:45:10,823 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 115 transitions, 254 flow [2022-03-15 19:45:10,824 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 115 transitions, 254 flow [2022-03-15 19:45:10,825 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 117 places, 115 transitions, 254 flow [2022-03-15 19:45:10,858 INFO L129 PetriNetUnfolder]: 8/112 cut-off events. [2022-03-15 19:45:10,858 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 19:45:10,861 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 8/112 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2022-03-15 19:45:10,863 INFO L116 LiptonReduction]: Number of co-enabled transitions 1010 [2022-03-15 19:45:13,437 INFO L131 LiptonReduction]: Checked pairs total: 1742 [2022-03-15 19:45:13,437 INFO L133 LiptonReduction]: Total number of compositions: 96 [2022-03-15 19:45:13,443 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 29 transitions, 82 flow [2022-03-15 19:45:13,470 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 212 states, 211 states have (on average 3.203791469194313) internal successors, (676), 211 states have internal predecessors, (676), 0 states have call successors, (0), 0 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 19:45:13,473 INFO L276 IsEmpty]: Start isEmpty. Operand has 212 states, 211 states have (on average 3.203791469194313) internal successors, (676), 211 states have internal predecessors, (676), 0 states have call successors, (0), 0 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 19:45:13,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:45:13,480 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:13,481 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 19:45:13,481 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 19:45:13,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:13,485 INFO L85 PathProgramCache]: Analyzing trace with hash 533497716, now seen corresponding path program 1 times [2022-03-15 19:45:13,498 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:13,498 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879699639] [2022-03-15 19:45:13,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:13,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:13,744 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 19:45:13,744 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:13,744 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879699639] [2022-03-15 19:45:13,745 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879699639] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:45:13,745 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:45:13,745 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:45:13,746 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1232087659] [2022-03-15 19:45:13,746 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:13,750 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:13,772 INFO L252 McrAutomatonBuilder]: Finished intersection with 106 states and 243 transitions. [2022-03-15 19:45:13,772 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:14,592 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [548#(not (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), 549#(< 0 (mod ~s~0 4294967296))] [2022-03-15 19:45:14,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 19:45:14,594 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:14,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 19:45:14,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-15 19:45:14,609 INFO L87 Difference]: Start difference. First operand has 212 states, 211 states have (on average 3.203791469194313) internal successors, (676), 211 states have internal predecessors, (676), 0 states have call successors, (0), 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 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 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 19:45:14,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:14,738 INFO L93 Difference]: Finished difference Result 336 states and 1092 transitions. [2022-03-15 19:45:14,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 19:45:14,740 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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 19:45:14,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:14,748 INFO L225 Difference]: With dead ends: 336 [2022-03-15 19:45:14,748 INFO L226 Difference]: Without dead ends: 336 [2022-03-15 19:45:14,749 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-03-15 19:45:14,751 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 44 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:14,752 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 24 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:45:14,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-03-15 19:45:14,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 274. [2022-03-15 19:45:14,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 273 states have (on average 3.238095238095238) internal successors, (884), 273 states have internal predecessors, (884), 0 states have call successors, (0), 0 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 19:45:14,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 884 transitions. [2022-03-15 19:45:14,789 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 884 transitions. Word has length 19 [2022-03-15 19:45:14,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:14,789 INFO L470 AbstractCegarLoop]: Abstraction has 274 states and 884 transitions. [2022-03-15 19:45:14,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 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 19:45:14,789 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 884 transitions. [2022-03-15 19:45:14,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:45:14,791 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:14,792 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 19:45:14,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 19:45:14,792 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 19:45:14,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:14,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1412588600, now seen corresponding path program 1 times [2022-03-15 19:45:14,793 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:14,793 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238649174] [2022-03-15 19:45:14,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:14,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:14,906 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 19:45:14,906 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:14,906 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238649174] [2022-03-15 19:45:14,906 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238649174] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:14,906 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646354561] [2022-03-15 19:45:14,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:14,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:14,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:14,908 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 19:45:14,951 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 19:45:15,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:15,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 19:45:15,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:15,083 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 19:45:15,083 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 19:45:15,083 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646354561] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:45:15,084 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 19:45:15,084 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 6 [2022-03-15 19:45:15,084 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [993148120] [2022-03-15 19:45:15,084 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:15,086 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:15,108 INFO L252 McrAutomatonBuilder]: Finished intersection with 158 states and 385 transitions. [2022-03-15 19:45:15,108 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:16,182 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [1504#(and (< 0 (mod ~t~0 4294967296)) (= thread2Thread1of1ForFork0_~cond~1 1)), 1503#(not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0))] [2022-03-15 19:45:16,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 19:45:16,183 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:16,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 19:45:16,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-03-15 19:45:16,185 INFO L87 Difference]: Start difference. First operand 274 states and 884 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 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 19:45:16,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:16,317 INFO L93 Difference]: Finished difference Result 390 states and 1287 transitions. [2022-03-15 19:45:16,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:45:16,318 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 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 19:45:16,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:16,323 INFO L225 Difference]: With dead ends: 390 [2022-03-15 19:45:16,324 INFO L226 Difference]: Without dead ends: 390 [2022-03-15 19:45:16,324 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-03-15 19:45:16,325 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 28 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:16,326 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 15 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:45:16,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-03-15 19:45:16,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 358. [2022-03-15 19:45:16,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 357 states have (on average 3.2969187675070026) internal successors, (1177), 357 states have internal predecessors, (1177), 0 states have call successors, (0), 0 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 19:45:16,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 1177 transitions. [2022-03-15 19:45:16,354 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 1177 transitions. Word has length 21 [2022-03-15 19:45:16,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:16,356 INFO L470 AbstractCegarLoop]: Abstraction has 358 states and 1177 transitions. [2022-03-15 19:45:16,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 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 19:45:16,357 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 1177 transitions. [2022-03-15 19:45:16,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:45:16,362 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:16,363 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 19:45:16,380 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 19:45:16,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:16,580 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 19:45:16,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:16,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1857247744, now seen corresponding path program 1 times [2022-03-15 19:45:16,581 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:16,581 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108978309] [2022-03-15 19:45:16,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:16,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:16,821 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 19:45:16,821 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:16,821 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108978309] [2022-03-15 19:45:16,821 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108978309] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:45:16,821 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:45:16,822 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:45:16,822 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [906749325] [2022-03-15 19:45:16,822 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:16,825 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:16,839 INFO L252 McrAutomatonBuilder]: Finished intersection with 118 states and 269 transitions. [2022-03-15 19:45:16,839 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:18,017 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [2618#(< 0 (mod ~u~0 4294967296)), 2617#(not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0))] [2022-03-15 19:45:18,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 19:45:18,017 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:18,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 19:45:18,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-15 19:45:18,018 INFO L87 Difference]: Start difference. First operand 358 states and 1177 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 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 19:45:18,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:18,131 INFO L93 Difference]: Finished difference Result 452 states and 1492 transitions. [2022-03-15 19:45:18,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 19:45:18,132 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 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 19:45:18,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:18,134 INFO L225 Difference]: With dead ends: 452 [2022-03-15 19:45:18,134 INFO L226 Difference]: Without dead ends: 452 [2022-03-15 19:45:18,135 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 82 SyntacticMatches, 14 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-03-15 19:45:18,135 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 29 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:18,135 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 4 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:45:18,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2022-03-15 19:45:18,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 382. [2022-03-15 19:45:18,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 381 states have (on average 3.293963254593176) internal successors, (1255), 381 states have internal predecessors, (1255), 0 states have call successors, (0), 0 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 19:45:18,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1255 transitions. [2022-03-15 19:45:18,144 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1255 transitions. Word has length 21 [2022-03-15 19:45:18,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:18,144 INFO L470 AbstractCegarLoop]: Abstraction has 382 states and 1255 transitions. [2022-03-15 19:45:18,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 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 19:45:18,145 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1255 transitions. [2022-03-15 19:45:18,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:45:18,146 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:18,146 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 19:45:18,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 19:45:18,146 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 19:45:18,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:18,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1682607949, now seen corresponding path program 1 times [2022-03-15 19:45:18,148 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:18,148 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453081858] [2022-03-15 19:45:18,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:18,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:18,210 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 19:45:18,210 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:18,210 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453081858] [2022-03-15 19:45:18,210 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453081858] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:45:18,210 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:45:18,210 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 19:45:18,210 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1480483234] [2022-03-15 19:45:18,210 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:18,213 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:18,224 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 170 transitions. [2022-03-15 19:45:18,224 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:18,616 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [3844#(or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0))), 3843#(not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)), 3846#(or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0))), 3842#(not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)), 3845#(< 0 (mod (+ 4294967295 ~u~0) 4294967296))] [2022-03-15 19:45:18,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:45:18,616 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:18,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:45:18,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-03-15 19:45:18,618 INFO L87 Difference]: Start difference. First operand 382 states and 1255 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 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 19:45:19,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:19,053 INFO L93 Difference]: Finished difference Result 518 states and 1767 transitions. [2022-03-15 19:45:19,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 19:45:19,054 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 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 23 [2022-03-15 19:45:19,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:19,056 INFO L225 Difference]: With dead ends: 518 [2022-03-15 19:45:19,056 INFO L226 Difference]: Without dead ends: 518 [2022-03-15 19:45:19,057 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2022-03-15 19:45:19,057 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 148 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:19,058 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 0 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:45:19,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2022-03-15 19:45:19,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 440. [2022-03-15 19:45:19,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 3.416856492027335) internal successors, (1500), 439 states have internal predecessors, (1500), 0 states have call successors, (0), 0 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 19:45:19,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1500 transitions. [2022-03-15 19:45:19,067 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1500 transitions. Word has length 23 [2022-03-15 19:45:19,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:19,067 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 1500 transitions. [2022-03-15 19:45:19,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 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 19:45:19,068 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1500 transitions. [2022-03-15 19:45:19,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:45:19,069 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:19,069 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 19:45:19,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 19:45:19,069 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 19:45:19,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:19,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1883685837, now seen corresponding path program 2 times [2022-03-15 19:45:19,070 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:19,070 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604671316] [2022-03-15 19:45:19,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:19,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:19,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:20,070 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 19:45:20,071 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:20,071 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604671316] [2022-03-15 19:45:20,071 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604671316] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:20,071 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63081992] [2022-03-15 19:45:20,071 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:45:20,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:20,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:20,084 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 19:45:20,085 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 19:45:20,225 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:45:20,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:45:20,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 19:45:20,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:20,900 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 19:45:20,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:45:22,438 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 19:45:22,439 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63081992] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:22,439 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:22,439 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 25 [2022-03-15 19:45:22,439 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1403183502] [2022-03-15 19:45:22,439 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:22,441 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:22,453 INFO L252 McrAutomatonBuilder]: Finished intersection with 96 states and 204 transitions. [2022-03-15 19:45:22,453 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:38,665 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [5440#(and (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (= ~s~0 ~S~0)) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ (* (div ~t~0 4294967296) 4294967296) (* (div ~u~0 4294967296) 4294967296)) (+ ~U~0 ~T~0))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (<= (* (div ~t~0 4294967296) 4294967296) (+ ~T~0 1))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (div ~U~0 4294967296) (div ~u~0 4294967296))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (= ~m~0 0)) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ ~U~0 ~T~0) (+ (* (div ~u~0 4294967296) 4294967296) (* (div ~T~0 4294967296) 4294967296) 4294967296))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ (* (div ~T~0 4294967296) 4294967296) 1) ~t~0))), 5439#(and (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ (div ~s~0 4294967296) 2 (div ~u~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (<= (+ ~s~0 1) ~S~0) (not (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (not (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (< (div ~s~0 4294967296) (+ (div ~S~0 4294967296) 1))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ ~s~0 1) ~S~0)) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0) (+ ~s~0 ~m~0 (* (div ~u~0 4294967296) 4294967296) (* (div ~T~0 4294967296) 4294967296) 4294967296)) (<= (+ ~s~0 1) ~S~0) (not (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (<= (+ ~U~0 ~T~0 ~S~0) (+ ~s~0 (* (div ~u~0 4294967296) 4294967296) 4294967297 (* (div ~T~0 4294967296) 4294967296))) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (not (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) 2 (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (not (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< (div ~u~0 4294967296) (+ (div ~U~0 4294967296) 1))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (div ~U~0 4294967296) (div ~u~0 4294967296))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (+ ~s~0 1) ~S~0) (not (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (<= (+ (div ~s~0 4294967296) 2 (div ~u~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (< (div ~t~0 4294967296) (+ (div ~T~0 4294967296) 1)) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) 2 (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (not (<= (+ (div ~s~0 4294967296) 2 (div ~u~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (<= ~S~0 (+ ~s~0 ~m~0)) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) 2 (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0) (+ ~s~0 ~m~0 (* (div ~u~0 4294967296) 4294967296) (* (div ~T~0 4294967296) 4294967296) 4294967296)) (not (<= ~S~0 (* (div ~S~0 4294967296) 4294967296))) (<= (* (div ~S~0 4294967296) 4294967296) (+ ~s~0 1))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= ~S~0 (* (div ~S~0 4294967296) 4294967296))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ (* (div ~T~0 4294967296) 4294967296) 1) ~t~0)) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (* (div ~S~0 4294967296) 4294967296) (+ ~s~0 1))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0) (+ ~s~0 ~m~0 (* (div ~u~0 4294967296) 4294967296) (* (div ~T~0 4294967296) 4294967296) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)))), 5437#(and (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (not (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) 2 (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ (* (div ~U~0 4294967296) 4294967296) (* (div ~S~0 4294967296) 4294967296) ~m~0 (* (div ~T~0 4294967296) 4294967296) 4294967296) (+ ~U~0 ~T~0 ~S~0))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)))), 5441#(and (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~s~0 ~m~0 (* (div ~T~0 4294967296) 4294967296) 4294967296)) (not (<= ~S~0 (* (div ~S~0 4294967296) 4294967296))) (<= (* (div ~S~0 4294967296) 4294967296) (+ ~s~0 1))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (<= (+ (div ~s~0 4294967296) 2 (div (+ (- 1) ~u~0) 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ ~s~0 1) ~S~0) (not (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (not (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)))) (or (<= (+ (div ~s~0 4294967296) 2 (div (+ (- 1) ~u~0) 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (< (div ~t~0 4294967296) (+ (div ~T~0 4294967296) 1)) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) 2 (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (div ~U~0 4294967296) (div (+ (- 1) ~u~0) 4294967296))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (* (div ~S~0 4294967296) 4294967296) (+ ~s~0 1))) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ (* (div ~T~0 4294967296) 4294967296) 1) ~t~0)) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~s~0 ~m~0 (* (div ~T~0 4294967296) 4294967296) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ ~s~0 1) ~S~0)) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (not (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) 2 (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~s~0 4294967297 (* (div ~T~0 4294967296) 4294967296)))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~s~0 ~m~0 (* (div ~T~0 4294967296) 4294967296) 4294967296)) (<= (+ ~s~0 1) ~S~0) (not (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (< (div (+ (- 1) ~u~0) 4294967296) (+ (div ~U~0 4294967296) 1))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= ~S~0 (+ ~s~0 ~m~0)) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) 2 (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (not (<= (+ (div ~s~0 4294967296) 2 (div (+ (- 1) ~u~0) 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (< (div ~s~0 4294967296) (+ (div ~S~0 4294967296) 1))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (+ ~s~0 1) ~S~0) (not (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)))), 5443#(and (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~s~0 ~m~0 (* (div ~T~0 4294967296) 4294967296) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (not (<= ~S~0 (* (div ~S~0 4294967296) 4294967296))) (<= (* (div ~S~0 4294967296) 4294967296) (+ ~s~0 1))) (or (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296)))) (or (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~s~0 ~m~0 (* (div ~T~0 4294967296) 4294967296) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (< (div ~s~0 4294967296) (+ (div ~S~0 4294967296) 1)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296)))) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (< (div (+ (- 1) ~u~0) 4294967296) (+ (div ~U~0 4294967296) 1))) (or (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= (* (div ~S~0 4294967296) 4294967296) (+ ~s~0 1))) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (+ ~s~0 1) ~S~0) (not (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)))) (or (not (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) 2 (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (not (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~s~0 4294967297 (* (div ~T~0 4294967296) 4294967296)))) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~s~0 ~m~0 (* (div ~T~0 4294967296) 4294967296) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= (+ ~s~0 1) ~S~0) (not (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)))) (or (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= (+ ~s~0 1) ~S~0)) (or (<= (+ (div ~s~0 4294967296) 2 (div (+ (- 1) ~u~0) 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= (+ ~s~0 1) ~S~0) (not (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (not (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)))) (or (<= (+ (div ~s~0 4294967296) 2 (div (+ (- 1) ~u~0) 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (< (div (+ ~t~0 1) 4294967296) (+ (div ~T~0 4294967296) 1)) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) 2 (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= ~S~0 (+ ~s~0 ~m~0)) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) 2 (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (not (<= (+ (div ~s~0 4294967296) 2 (div (+ (- 1) ~u~0) 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)))) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= (div ~U~0 4294967296) (div (+ (- 1) ~u~0) 4294967296))) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (* (div ~T~0 4294967296) 4294967296) ~t~0))), 5442#(and (or (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~s~0 ~m~0 (* (div ~T~0 4294967296) 4294967296) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (<= (+ (div ~s~0 4294967296) 2 (div (+ (- 1) ~u~0) 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (< (div (+ ~t~0 1) 4294967296) (+ (div ~T~0 4294967296) 1)) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) 2 (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= (+ ~s~0 1) ~S~0) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~s~0 ~m~0 (* (div ~T~0 4294967296) 4294967296) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (not (<= ~S~0 (* (div ~S~0 4294967296) 4294967296))) (<= (* (div ~S~0 4294967296) 4294967296) (+ ~s~0 1)) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (not (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) 2 (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (not (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~s~0 4294967297 (* (div ~T~0 4294967296) 4294967296))) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (< (div (+ (- 1) ~u~0) 4294967296) (+ (div ~U~0 4294967296) 1)) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (<= (+ (div ~s~0 4294967296) 2 (div (+ (- 1) ~u~0) 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= (+ ~s~0 1) ~S~0) (not (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (not (<= ~S~0 (* (div ~S~0 4294967296) 4294967296))) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (+ ~s~0 1) ~S~0) (not (<= ~S~0 (* (div ~S~0 4294967296) 4294967296))) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= (div ~U~0 4294967296) (div (+ (- 1) ~u~0) 4294967296)) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~s~0 ~m~0 (* (div ~T~0 4294967296) 4294967296) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= (+ ~s~0 1) ~S~0) (not (<= ~S~0 (* (div ~S~0 4294967296) 4294967296))) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (* (div ~T~0 4294967296) 4294967296) ~t~0) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (< (div ~s~0 4294967296) (+ (div ~S~0 4294967296) 1)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= (* (div ~S~0 4294967296) 4294967296) (+ ~s~0 1)) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= ~S~0 (+ ~s~0 ~m~0)) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) 2 (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0) (not (<= (+ (div ~s~0 4294967296) 2 (div (+ (- 1) ~u~0) 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))))), 5438#(and (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (not (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) 2 (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ (* (div ~U~0 4294967296) 4294967296) (* (div ~S~0 4294967296) 4294967296) ~m~0 (* (div ~T~0 4294967296) 4294967296) 4294967296) (+ ~U~0 ~T~0 ~S~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (not (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) 2 (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (<= 1 thread1Thread1of1ForFork2_~cond~0)) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (+ (* (div ~U~0 4294967296) 4294967296) (* (div ~S~0 4294967296) 4294967296) ~m~0 (* (div ~T~0 4294967296) 4294967296) 4294967296) (+ ~U~0 ~T~0 ~S~0))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)))] [2022-03-15 19:45:38,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:45:38,666 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:38,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:45:38,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=918, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:45:38,667 INFO L87 Difference]: Start difference. First operand 440 states and 1500 transitions. Second operand has 17 states, 16 states have (on average 4.625) internal successors, (74), 16 states have internal predecessors, (74), 0 states have call successors, (0), 0 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 19:45:56,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:56,603 INFO L93 Difference]: Finished difference Result 1642 states and 5405 transitions. [2022-03-15 19:45:56,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-15 19:45:56,604 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.625) internal successors, (74), 16 states have internal predecessors, (74), 0 states have call successors, (0), 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 19:45:56,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:56,622 INFO L225 Difference]: With dead ends: 1642 [2022-03-15 19:45:56,622 INFO L226 Difference]: Without dead ends: 1424 [2022-03-15 19:45:56,623 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 74 SyntacticMatches, 19 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1784 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=827, Invalid=4285, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 19:45:56,624 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 328 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 1407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:56,624 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [328 Valid, 3 Invalid, 1407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-03-15 19:45:56,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2022-03-15 19:45:56,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 632. [2022-03-15 19:45:56,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 631 states have (on average 3.416798732171157) internal successors, (2156), 631 states have internal predecessors, (2156), 0 states have call successors, (0), 0 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 19:45:56,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 2156 transitions. [2022-03-15 19:45:56,641 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 2156 transitions. Word has length 23 [2022-03-15 19:45:56,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:56,641 INFO L470 AbstractCegarLoop]: Abstraction has 632 states and 2156 transitions. [2022-03-15 19:45:56,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.625) internal successors, (74), 16 states have internal predecessors, (74), 0 states have call successors, (0), 0 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 19:45:56,642 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 2156 transitions. [2022-03-15 19:45:56,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:45:56,643 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:56,643 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 19:45:56,665 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 19:45:56,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:56,860 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 19:45:56,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:56,860 INFO L85 PathProgramCache]: Analyzing trace with hash 577520205, now seen corresponding path program 3 times [2022-03-15 19:45:56,861 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:56,861 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595758280] [2022-03-15 19:45:56,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:56,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:56,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:57,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:57,001 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:57,001 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595758280] [2022-03-15 19:45:57,001 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595758280] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:57,001 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970462549] [2022-03-15 19:45:57,001 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:45:57,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:57,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:57,003 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 19:45:57,003 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 19:45:57,134 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:45:57,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:45:57,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 19:45:57,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:57,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:57,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:45:57,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:57,267 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970462549] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:57,267 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:57,267 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 10 [2022-03-15 19:45:57,268 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1069798443] [2022-03-15 19:45:57,268 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:57,270 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:57,280 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 150 transitions. [2022-03-15 19:45:57,280 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:57,866 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [8533#(not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), 8568#(not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)), 8571#(or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (not (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0))), 8569#(or (= ~u~0 ~U~0) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)), 8573#(< 0 (mod (+ 4294967295 ~u~0) 4294967296)), 8572#(and (or (not (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (= thread3Thread1of1ForFork1_~cond~2 1)) (or (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (not (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)))), 8570#(or (= ~u~0 ~U~0) (not (< 0 (mod ~u~0 4294967296))))] [2022-03-15 19:45:57,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:45:57,866 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:57,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:45:57,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-03-15 19:45:57,867 INFO L87 Difference]: Start difference. First operand 632 states and 2156 transitions. Second operand has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 12 states have internal predecessors, (64), 0 states have call successors, (0), 0 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 19:45:58,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:58,361 INFO L93 Difference]: Finished difference Result 866 states and 2902 transitions. [2022-03-15 19:45:58,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 19:45:58,362 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 12 states have internal predecessors, (64), 0 states have call successors, (0), 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 19:45:58,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:58,366 INFO L225 Difference]: With dead ends: 866 [2022-03-15 19:45:58,366 INFO L226 Difference]: Without dead ends: 866 [2022-03-15 19:45:58,366 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 77 SyntacticMatches, 14 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2022-03-15 19:45:58,367 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 133 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:58,367 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 0 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:45:58,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2022-03-15 19:45:58,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 710. [2022-03-15 19:45:58,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 709 states have (on average 3.406205923836389) internal successors, (2415), 709 states have internal predecessors, (2415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:58,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 2415 transitions. [2022-03-15 19:45:58,381 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 2415 transitions. Word has length 23 [2022-03-15 19:45:58,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:58,382 INFO L470 AbstractCegarLoop]: Abstraction has 710 states and 2415 transitions. [2022-03-15 19:45:58,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 12 states have internal predecessors, (64), 0 states have call successors, (0), 0 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 19:45:58,382 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 2415 transitions. [2022-03-15 19:45:58,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:45:58,383 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:58,383 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 19:45:58,400 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 19:45:58,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:58,600 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 19:45:58,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:58,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1457646229, now seen corresponding path program 1 times [2022-03-15 19:45:58,601 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:58,601 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966152190] [2022-03-15 19:45:58,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:58,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:58,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:58,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:58,803 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:58,803 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966152190] [2022-03-15 19:45:58,803 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966152190] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:58,803 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448644119] [2022-03-15 19:45:58,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:58,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:58,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:58,805 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 19:45:58,819 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 19:45:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:58,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 19:45:58,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:59,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:59,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:00,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:00,052 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448644119] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:00,052 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:00,053 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 23 [2022-03-15 19:46:00,053 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [236488684] [2022-03-15 19:46:00,053 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:00,055 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:00,064 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 158 transitions. [2022-03-15 19:46:00,064 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:46:01,873 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [10988#(or (not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (not (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0))), 11040#(and (or (<= ~t~0 (+ (* (div ~T~0 4294967296) 4294967296) 4294967296)) (<= (* (div ~S~0 4294967296) 4294967296) ~s~0) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (or (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~s~0) (< 0 (mod ~t~0 4294967296)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (or (<= ~t~0 (+ (* (div ~T~0 4294967296) 4294967296) 4294967296)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (not (< 0 (mod ~t~0 4294967296))) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967294))) (or (<= (* (div ~S~0 4294967296) 4294967296) ~s~0) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ 2 (* (div ~T~0 4294967296) 4294967296)) ~t~0)) (or (< 0 (mod ~t~0 4294967296)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967295))) (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (not (< 0 (mod ~t~0 4294967296))) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967294)) (<= (+ 2 (* (div ~T~0 4294967296) 4294967296)) ~t~0))), 11035#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))), 10992#(or (< 0 (mod ~t~0 4294967296)) (not (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))), 11036#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))), 11037#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (not (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0))), 11038#(and (or (< 0 (mod ~t~0 4294967296)) (< (div (+ (- 1) (* (- 1) ~s~0)) (- 4294967296)) (+ 2 (div (+ (- 1) ~s~0) 4294967296))) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (< 0 (mod ~u~0 4294967296))) (or (< (div (- ~t~0) (- 4294967296)) (+ (div (+ (- 2) ~t~0) 4294967296) 2)) (< (div (+ (- 2) (* (- 1) ~s~0)) (- 4294967296)) (+ (div ~s~0 4294967296) 2)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (< 0 (mod ~u~0 4294967296)))), 11039#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 (mod ~t~0 4294967296)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (< 0 (mod ~u~0 4294967296)))), 11034#(not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)), 10984#(not (<= (mod thread1Thread1of1ForFork2_~cond~0 256) 0))] [2022-03-15 19:46:01,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:46:01,874 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:46:01,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:46:01,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=761, Unknown=0, NotChecked=0, Total=930 [2022-03-15 19:46:01,875 INFO L87 Difference]: Start difference. First operand 710 states and 2415 transitions. Second operand has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 17 states have internal predecessors, (73), 0 states have call successors, (0), 0 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 19:46:05,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:05,134 INFO L93 Difference]: Finished difference Result 1982 states and 6626 transitions. [2022-03-15 19:46:05,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-03-15 19:46:05,134 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 17 states have internal predecessors, (73), 0 states have call successors, (0), 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 19:46:05,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:05,143 INFO L225 Difference]: With dead ends: 1982 [2022-03-15 19:46:05,143 INFO L226 Difference]: Without dead ends: 1982 [2022-03-15 19:46:05,144 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 66 SyntacticMatches, 10 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1776 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1043, Invalid=4657, Unknown=0, NotChecked=0, Total=5700 [2022-03-15 19:46:05,145 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 475 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 1177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:05,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [475 Valid, 16 Invalid, 1177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 19:46:05,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2022-03-15 19:46:05,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 838. [2022-03-15 19:46:05,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 3.4850657108721625) internal successors, (2917), 837 states have internal predecessors, (2917), 0 states have call successors, (0), 0 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 19:46:05,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 2917 transitions. [2022-03-15 19:46:05,174 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 2917 transitions. Word has length 23 [2022-03-15 19:46:05,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:05,175 INFO L470 AbstractCegarLoop]: Abstraction has 838 states and 2917 transitions. [2022-03-15 19:46:05,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 17 states have internal predecessors, (73), 0 states have call successors, (0), 0 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 19:46:05,175 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 2917 transitions. [2022-03-15 19:46:05,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:46:05,177 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:05,177 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 19:46:05,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-03-15 19:46:05,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:05,394 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 19:46:05,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:05,394 INFO L85 PathProgramCache]: Analyzing trace with hash -134804023, now seen corresponding path program 1 times [2022-03-15 19:46:05,396 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:05,396 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335436692] [2022-03-15 19:46:05,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:05,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:05,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:05,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:05,609 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:05,610 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335436692] [2022-03-15 19:46:05,610 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335436692] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:05,610 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784027309] [2022-03-15 19:46:05,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:05,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:05,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:05,611 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 19:46:05,613 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 19:46:05,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:05,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 19:46:05,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:05,802 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 19:46:05,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:05,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:05,919 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784027309] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:05,919 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:05,919 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 13 [2022-03-15 19:46:05,919 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1957302167] [2022-03-15 19:46:05,919 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:05,921 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:05,935 INFO L252 McrAutomatonBuilder]: Finished intersection with 112 states and 242 transitions. [2022-03-15 19:46:05,935 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:46:08,331 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [14946#(and (or (<= ~t~0 (+ ~T~0 1)) (< (* (div ~T~0 4294967296) 4294967296) ~T~0)) (<= ~T~0 (+ ~t~0 1)) (<= ~t~0 (+ 4294967295 (* (div ~T~0 4294967296) 4294967296))) (or (<= (mod ~t~0 4294967296) 0) (<= ~T~0 ~t~0))), 14947#(and (<= ~T~0 (+ ~t~0 1)) (<= (* (div ~T~0 4294967296) 4294967296) ~t~0) (< (div (+ ~t~0 1) 4294967296) (+ (div ~T~0 4294967296) 1)))] [2022-03-15 19:46:08,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 19:46:08,331 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:46:08,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 19:46:08,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-03-15 19:46:08,332 INFO L87 Difference]: Start difference. First operand 838 states and 2917 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 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 19:46:08,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:08,618 INFO L93 Difference]: Finished difference Result 1896 states and 6587 transitions. [2022-03-15 19:46:08,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 19:46:08,618 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 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 25 [2022-03-15 19:46:08,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:08,628 INFO L225 Difference]: With dead ends: 1896 [2022-03-15 19:46:08,629 INFO L226 Difference]: Without dead ends: 1880 [2022-03-15 19:46:08,629 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 102 SyntacticMatches, 26 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2022-03-15 19:46:08,629 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 74 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:08,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 14 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:46:08,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2022-03-15 19:46:08,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1052. [2022-03-15 19:46:08,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1051 states have (on average 3.6022835394862036) internal successors, (3786), 1051 states have internal predecessors, (3786), 0 states have call successors, (0), 0 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 19:46:08,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 3786 transitions. [2022-03-15 19:46:08,654 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 3786 transitions. Word has length 25 [2022-03-15 19:46:08,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:08,654 INFO L470 AbstractCegarLoop]: Abstraction has 1052 states and 3786 transitions. [2022-03-15 19:46:08,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 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 19:46:08,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 3786 transitions. [2022-03-15 19:46:08,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:46:08,656 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:08,657 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 19:46:08,673 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 19:46:08,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:08,873 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 19:46:08,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:08,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1920618517, now seen corresponding path program 2 times [2022-03-15 19:46:08,874 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:08,875 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229868261] [2022-03-15 19:46:08,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:08,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:08,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:11,476 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:11,476 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:11,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229868261] [2022-03-15 19:46:11,477 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229868261] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:11,477 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80095766] [2022-03-15 19:46:11,477 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:46:11,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:11,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:11,478 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 19:46:11,480 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 19:46:11,633 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:46:11,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:46:11,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 19:46:11,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:12,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:12,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:16,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:16,737 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80095766] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:16,737 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:16,737 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 23 [2022-03-15 19:46:16,737 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2027111363] [2022-03-15 19:46:16,737 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:16,739 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:16,753 INFO L252 McrAutomatonBuilder]: Finished intersection with 106 states and 229 transitions. [2022-03-15 19:46:16,753 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:47:16,069 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [19128#(and (or (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (not (<= ~T~0 (* (div ~T~0 4294967296) 4294967296))) (not (< 0 (mod ~t~0 4294967296))) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967294)) (<= (+ ~s~0 (* (div ~u~0 4294967296) 4294967296) (* (div ~T~0 4294967296) 4294967296) 1) (+ ~U~0 ~T~0 ~S~0)) (not (<= (div ~U~0 4294967296) (div ~u~0 4294967296)))) (or (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~s~0) (< 0 (mod ~t~0 4294967296)) (<= (+ (* (div ~U~0 4294967296) 4294967296) (* (div ~S~0 4294967296) 4294967296) ~U~0 ~T~0) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0)) (not (<= (div ~U~0 4294967296) (div ~u~0 4294967296)))) (or (<= (mod ~t~0 4294967296) 0) (< (div ~u~0 4294967296) (div ~U~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0) (+ ~u~0 ~s~0 (* (div (+ (* (- 1) ~s~0) ~T~0 ~S~0) 4294967296) 4294967296) 1)) (<= ~s~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) ~s~0) 4294967296)))) (< (* (div ~T~0 4294967296) 4294967296) ~T~0)) (or (< (div ~u~0 4294967296) (div ~U~0 4294967296)) (< (* (div ~S~0 4294967296) 4294967296) ~S~0) (<= (+ ~T~0 (* (div (+ (- 1) ~t~0) 4294967296) 4294967296) 1) (+ ~t~0 (* (div ~T~0 4294967296) 4294967296))) (<= ~s~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) ~s~0) 4294967296))))) (or (<= ~s~0 (+ (* (div (+ (- 2) ~s~0) 4294967296) 4294967296) 4294967296)) (< 0 (mod ~t~0 4294967296)) (<= (+ (* (div ~t~0 4294967296) 4294967296) ~T~0) (+ ~t~0 (* (div ~T~0 4294967296) 4294967296))) (not (<= ~S~0 (* (div ~S~0 4294967296) 4294967296))) (not (<= (div ~U~0 4294967296) (div ~u~0 4294967296)))) (or (< (div ~u~0 4294967296) (div ~U~0 4294967296)) (< 0 (mod ~t~0 4294967296)) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967295)) (<= (+ ~U~0 ~S~0) (+ (* (div ~S~0 4294967296) 4294967296) ~u~0 4294967296))) (or (<= (mod ~t~0 4294967296) 0) (< (div ~u~0 4294967296) (div ~U~0 4294967296)) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967294)) (<= (+ ~U~0 ~S~0) (+ (* (div ~S~0 4294967296) 4294967296) ~u~0 4294967296)) (< (* (div ~T~0 4294967296) 4294967296) ~T~0)) (or (< 0 (mod ~t~0 4294967296)) (<= (+ (* (div ~U~0 4294967296) 4294967296) (* (div ~S~0 4294967296) 4294967296) ~U~0 ~T~0) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0)) (not (<= (+ (div ~S~0 4294967296) 1) (div ~s~0 4294967296))) (not (<= (div ~U~0 4294967296) (div ~u~0 4294967296)))) (or (<= ~s~0 (+ (* (div (+ (- 2) ~s~0) 4294967296) 4294967296) 4294967296)) (< (div ~u~0 4294967296) (div ~U~0 4294967296)) (< 0 (mod ~t~0 4294967296)) (< (* (div ~U~0 4294967296) 4294967296) ~U~0)) (or (<= ~S~0 (+ ~s~0 1)) (< (div ~u~0 4294967296) (div ~U~0 4294967296)) (<= ~S~0 (* (div ~S~0 4294967296) 4294967296))) (or (< (div ~u~0 4294967296) (div ~U~0 4294967296)) (<= ~S~0 ~s~0) (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (< 0 (mod ~t~0 4294967296))) (< (div ~u~0 4294967296) (+ (div ~U~0 4294967296) 1)) (or (<= (+ (* (div ~U~0 4294967296) 4294967296) (* (div ~S~0 4294967296) 4294967296) ~U~0 ~T~0) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0)) (not (< 0 (mod ~t~0 4294967296))) (not (<= (+ (div ~S~0 4294967296) 1) (div (+ ~s~0 1) 4294967296))) (not (<= ~S~0 (* (div ~S~0 4294967296) 4294967296))) (not (<= (div ~U~0 4294967296) (div ~u~0 4294967296)))) (or (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (< 0 (mod ~t~0 4294967296)) (<= (+ ~s~0 (* (div ~u~0 4294967296) 4294967296) (* (div ~T~0 4294967296) 4294967296)) (+ ~U~0 ~T~0 ~S~0)) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967295)) (not (<= (div ~U~0 4294967296) (div ~u~0 4294967296)))) (or (< (div ~u~0 4294967296) (div ~U~0 4294967296)) (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967294)) (<= (+ ~T~0 (* (div (+ (- 1) ~t~0) 4294967296) 4294967296) 1) (+ ~t~0 (* (div ~T~0 4294967296) 4294967296)))) (or (< (div ~u~0 4294967296) (div ~U~0 4294967296)) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (+ ~T~0 (* (div (+ (- 1) ~t~0) 4294967296) 4294967296) 1) (+ ~t~0 (* (div ~T~0 4294967296) 4294967296))) (<= ~s~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) ~s~0) 4294967296))))) (or (< (div ~u~0 4294967296) (div ~U~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0) (+ ~u~0 ~s~0 (* (div (+ (* (- 1) ~s~0) ~T~0 ~S~0) 4294967296) 4294967296) 1)) (<= (+ ~T~0 (* (div (+ (- 1) ~t~0) 4294967296) 4294967296) 1) (+ ~t~0 (* (div ~T~0 4294967296) 4294967296))) (<= ~s~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) ~s~0) 4294967296))))) (or (< (div ~u~0 4294967296) (div ~U~0 4294967296)) (<= (+ (* (div ~U~0 4294967296) 4294967296) (* (div ~S~0 4294967296) 4294967296) ~U~0 ~T~0) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0)) (<= (* (div ~S~0 4294967296) 4294967296) ~s~0)) (or (<= (mod ~t~0 4294967296) 0) (< (div ~u~0 4294967296) (div ~U~0 4294967296)) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= ~s~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) ~s~0) 4294967296)))) (< (* (div ~T~0 4294967296) 4294967296) ~T~0)) (or (< (div ~u~0 4294967296) (div ~U~0 4294967296)) (= ~m~0 0)) (or (<= ~s~0 (+ (* (div (+ (- 2) ~s~0) 4294967296) 4294967296) 4294967296)) (< 0 (mod ~t~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div (+ (* (- 1) ~s~0) ~T~0 ~S~0 1) 4294967296) 4294967296) ~u~0 ~s~0)) (not (<= (div ~U~0 4294967296) (div ~u~0 4294967296)))) (or (< (div ~u~0 4294967296) (div ~U~0 4294967296)) (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (<= (+ (* (div ~t~0 4294967296) 4294967296) ~T~0) (+ ~t~0 (* (div ~T~0 4294967296) 4294967296))) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967295))) (<= (* (div ~U~0 4294967296) 4294967296) (+ ~u~0 1))), 19127#(and (or (<= (div ~m~0 4294967296) 0) (<= (+ (* (div ~t~0 4294967296) 4294967296) ~T~0) (+ ~t~0 (* (div ~T~0 4294967296) 4294967296))) (<= (+ (* (div ~s~0 4294967296) 4294967296) 1) ~s~0) (< (div (+ (- 1) ~u~0) 4294967296) (div ~U~0 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (<= (* (div ~U~0 4294967296) 4294967296) ~u~0) (or (not (<= (div ~U~0 4294967296) (div (+ (- 1) ~u~0) 4294967296))) (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (not (<= ~U~0 (* (div ~U~0 4294967296) 4294967296))) (<= (+ (* (div ~t~0 4294967296) 4294967296) ~T~0) (+ ~t~0 (* (div ~T~0 4294967296) 4294967296))) (<= (+ (* (div ~s~0 4294967296) 4294967296) 1) ~s~0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (<= (+ (* (div ~t~0 4294967296) 4294967296) (* (div ~U~0 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) 4294967297 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~t~0 ~s~0 ~m~0)) (not (<= (div ~U~0 4294967296) (div (+ (- 1) ~u~0) 4294967296))) (not (<= ~T~0 (* (div ~T~0 4294967296) 4294967296))) (<= (+ (* (div ~s~0 4294967296) 4294967296) 1) ~s~0) (<= (+ (* (div ~U~0 4294967296) 4294967296) (* (div ~S~0 4294967296) 4294967296) ~U~0 ~T~0 1) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~m~0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (not (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)))) (or (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (<= (+ (* (div ~U~0 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) 4294967297 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~s~0 ~m~0)) (<= (+ (* (div ~s~0 4294967296) 4294967296) 1) ~s~0) (< (div (+ (- 1) ~u~0) 4294967296) (div ~U~0 4294967296)) (< (* (div ~T~0 4294967296) 4294967296) ~T~0) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (not (<= (div ~U~0 4294967296) (div (+ (- 1) ~u~0) 4294967296))) (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (not (<= ~T~0 (* (div ~T~0 4294967296) 4294967296))) (<= (div ~m~0 4294967296) 0) (<= (+ (* (div ~s~0 4294967296) 4294967296) 1) ~s~0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (<= 0 ~m~0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (+ (* (div ~t~0 4294967296) 4294967296) ~T~0) (+ ~t~0 (* (div ~T~0 4294967296) 4294967296))) (<= (+ (* (div ~s~0 4294967296) 4294967296) 1) ~s~0) (< (div (+ (- 1) ~u~0) 4294967296) (div ~U~0 4294967296))) (or (<= (+ (* (div ~t~0 4294967296) 4294967296) ~T~0) (+ ~t~0 (* (div ~T~0 4294967296) 4294967296))) (<= (+ (* (div ~s~0 4294967296) 4294967296) 1) ~s~0) (<= (+ (* (div ~U~0 4294967296) 4294967296) (* (div ~S~0 4294967296) 4294967296) ~U~0 ~T~0 1) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~m~0)) (< (* (div ~S~0 4294967296) 4294967296) ~S~0) (< (div (+ (- 1) ~u~0) 4294967296) (div ~U~0 4294967296))) (or (not (<= (div ~U~0 4294967296) (div (+ (- 1) ~u~0) 4294967296))) (not (<= ~T~0 (* (div ~T~0 4294967296) 4294967296))) (not (<= ~U~0 (* (div ~U~0 4294967296) 4294967296))) (<= (+ (div ~S~0 4294967296) (div (+ (- 1) ~u~0) 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (<= (+ (* (div ~s~0 4294967296) 4294967296) 1) ~s~0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (<= (div ~m~0 4294967296) 0) (<= (+ (* (div ~s~0 4294967296) 4294967296) 1) ~s~0) (< (div (+ (- 1) ~u~0) 4294967296) (div ~U~0 4294967296)) (< (* (div ~T~0 4294967296) 4294967296) ~T~0) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (<= (+ (* (div ~t~0 4294967296) 4294967296) ~T~0) (+ ~t~0 (* (div ~T~0 4294967296) 4294967296))) (<= (+ (* (div ~s~0 4294967296) 4294967296) 1) ~s~0) (< (* (div ~S~0 4294967296) 4294967296) ~S~0) (< (div (+ (- 1) ~u~0) 4294967296) (div ~U~0 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (+ (* (div ~t~0 4294967296) 4294967296) ~T~0) (+ ~t~0 (* (div ~T~0 4294967296) 4294967296))) (<= (+ (* (div ~s~0 4294967296) 4294967296) 1) ~s~0) (< (div (+ (- 1) ~u~0) 4294967296) (div ~U~0 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (<= (div ~m~0 4294967296) 0) (<= (+ (* (div ~t~0 4294967296) 4294967296) ~T~0) (+ ~t~0 (* (div ~T~0 4294967296) 4294967296))) (<= (+ (* (div ~s~0 4294967296) 4294967296) 1) ~s~0) (< (* (div ~S~0 4294967296) 4294967296) ~S~0) (< (div (+ (- 1) ~u~0) 4294967296) (div ~U~0 4294967296))) (or (<= 0 ~m~0) (not (<= (div ~U~0 4294967296) (div (+ (- 1) ~u~0) 4294967296))) (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (not (<= ~T~0 (* (div ~T~0 4294967296) 4294967296))) (not (<= ~U~0 (* (div ~U~0 4294967296) 4294967296))) (not (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (<= (+ (* (div ~s~0 4294967296) 4294967296) 1) ~s~0)) (or (<= (div ~m~0 4294967296) 0) (<= (+ (* (div ~t~0 4294967296) 4294967296) ~T~0) (+ ~t~0 (* (div ~T~0 4294967296) 4294967296))) (<= (+ (* (div ~s~0 4294967296) 4294967296) 1) ~s~0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (< (div (+ (- 1) ~u~0) 4294967296) (div ~U~0 4294967296))) (or (<= (+ (* (div ~t~0 4294967296) 4294967296) ~T~0) (+ ~t~0 (* (div ~T~0 4294967296) 4294967296))) (<= (+ (* (div ~U~0 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) 4294967297 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~s~0 ~m~0)) (<= (+ (* (div ~s~0 4294967296) 4294967296) 1) ~s~0) (< (div (+ (- 1) ~u~0) 4294967296) (div ~U~0 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (<= (+ ~U~0 ~S~0) (+ (* (div ~S~0 4294967296) 4294967296) 4294967295 ~u~0 ~m~0)) (not (<= (div ~U~0 4294967296) (div (+ (- 1) ~u~0) 4294967296))) (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (not (<= ~T~0 (* (div ~T~0 4294967296) 4294967296))) (<= (+ (* (div ~s~0 4294967296) 4294967296) 1) ~s~0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (<= (+ (* (div ~U~0 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) 1) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~s~0 ~m~0)) (<= (+ (* (div ~t~0 4294967296) 4294967296) ~T~0) (+ ~t~0 (* (div ~T~0 4294967296) 4294967296))) (<= (+ (* (div ~s~0 4294967296) 4294967296) 1) ~s~0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (< (div (+ (- 1) ~u~0) 4294967296) (div ~U~0 4294967296))) (or (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (+ (* (div ~s~0 4294967296) 4294967296) 1) ~s~0) (< (div (+ (- 1) ~u~0) 4294967296) (div ~U~0 4294967296)) (< (* (div ~T~0 4294967296) 4294967296) ~T~0) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (< (div (+ (- 1) ~u~0) 4294967296) (+ (div ~U~0 4294967296) 1)) (or (<= (+ (* (div ~t~0 4294967296) 4294967296) (* (div ~U~0 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) 4294967297 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~t~0 ~s~0 ~m~0)) (<= (+ (* (div ~s~0 4294967296) 4294967296) 1) ~s~0) (< (div (+ (- 1) ~u~0) 4294967296) (div ~U~0 4294967296)) (< (* (div ~T~0 4294967296) 4294967296) ~T~0) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (<= (+ (* (div ~t~0 4294967296) 4294967296) (* (div ~U~0 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) 4294967297 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~t~0 ~s~0 ~m~0)) (<= (+ (* (div ~s~0 4294967296) 4294967296) 1) ~s~0) (< (* (div ~S~0 4294967296) 4294967296) ~S~0) (<= (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) (* (div ~S~0 4294967296) 4294967296) ~m~0 (* (div ~T~0 4294967296) 4294967296)) (+ ~U~0 ~T~0 ~S~0)) (< (div (+ (- 1) ~u~0) 4294967296) (div ~U~0 4294967296)) (< (* (div ~T~0 4294967296) 4294967296) ~T~0)) (or (<= (+ (* (div ~U~0 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) 1) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~s~0 ~m~0)) (<= (+ (div ~S~0 4294967296) (div (+ (- 1) ~u~0) 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (<= (+ (* (div ~s~0 4294967296) 4294967296) 1) ~s~0) (< (* (div ~T~0 4294967296) 4294967296) ~T~0)))] [2022-03-15 19:47:16,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 19:47:16,069 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:47:16,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 19:47:16,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2022-03-15 19:47:16,070 INFO L87 Difference]: Start difference. First operand 1052 states and 3786 transitions. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 10 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 19:47:25,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:47:25,301 INFO L93 Difference]: Finished difference Result 1656 states and 5853 transitions. [2022-03-15 19:47:25,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 19:47:25,302 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 10 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 25 [2022-03-15 19:47:25,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:47:25,309 INFO L225 Difference]: With dead ends: 1656 [2022-03-15 19:47:25,309 INFO L226 Difference]: Without dead ends: 1490 [2022-03-15 19:47:25,310 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 35 SyntacticMatches, 77 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1517 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=266, Invalid=1216, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 19:47:25,311 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 107 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:47:25,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 4 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 19:47:25,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2022-03-15 19:47:25,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1078. [2022-03-15 19:47:25,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 1077 states have (on average 3.605385329619313) internal successors, (3883), 1077 states have internal predecessors, (3883), 0 states have call successors, (0), 0 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 19:47:25,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 3883 transitions. [2022-03-15 19:47:25,341 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 3883 transitions. Word has length 25 [2022-03-15 19:47:25,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:47:25,341 INFO L470 AbstractCegarLoop]: Abstraction has 1078 states and 3883 transitions. [2022-03-15 19:47:25,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 10 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 19:47:25,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 3883 transitions. [2022-03-15 19:47:25,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:47:25,344 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:47:25,344 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 19:47:25,362 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 19:47:25,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:25,563 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 19:47:25,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:47:25,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1456532507, now seen corresponding path program 3 times [2022-03-15 19:47:25,564 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:47:25,564 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721971641] [2022-03-15 19:47:25,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:47:25,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:47:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:26,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:26,865 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:47:26,865 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721971641] [2022-03-15 19:47:26,865 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721971641] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:47:26,865 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707934487] [2022-03-15 19:47:26,865 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:47:26,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:26,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:47:26,866 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 19:47:26,867 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 19:47:27,094 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:47:27,094 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:47:27,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 19:47:27,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:47:27,836 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:27,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:47:29,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:29,727 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707934487] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:47:29,727 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:47:29,727 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-03-15 19:47:29,727 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [831011198] [2022-03-15 19:47:29,727 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:47:29,729 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:47:29,747 INFO L252 McrAutomatonBuilder]: Finished intersection with 112 states and 241 transitions. [2022-03-15 19:47:29,747 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:47:46,395 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [23142#(and (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div ~U~0 4294967296) 4294967296) ~s~0 ~m~0 (* (div ~T~0 4294967296) 4294967296) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (<= 0 ~m~0) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ (div ~S~0 4294967296) (div ~u~0 4294967296) (div ~T~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= ~s~0 (* (div ~S~0 4294967296) 4294967296))) (or (not (<= (+ (div ~m~0 4294967296) 1) 0)) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ (* (div ~T~0 4294967296) 4294967296) 1) ~t~0)) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ (div ~S~0 4294967296) 2 (div ~u~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0) (+ ~s~0 ~m~0 (* (div ~u~0 4294967296) 4294967296) (* (div ~T~0 4294967296) 4294967296) 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ (* (div ~T~0 4294967296) 4294967296) 1) ~t~0) (<= (+ (div ~S~0 4294967296) 2 (div ~u~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0) (+ ~s~0 ~m~0 (* (div ~u~0 4294967296) 4294967296) (* (div ~T~0 4294967296) 4294967296) 4294967296)) (<= (+ (* (div ~T~0 4294967296) 4294967296) 1) ~t~0)) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967294))) (or (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ (* (div ~T~0 4294967296) 4294967296) 1) ~t~0)) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (* (div ~S~0 4294967296) 4294967296) ~s~0)) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0) (+ ~s~0 ~m~0 (* (div ~u~0 4294967296) 4294967296) (* (div ~T~0 4294967296) 4294967296) 4294967296)) (<= ~s~0 (* (div ~S~0 4294967296) 4294967296)))), 23141#(and (or (<= 0 ~m~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~s~0) (< 0 (mod (+ 4294967295 ~u~0) 4294967296))) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (<= (+ (div ~S~0 4294967296) 1) (div ~s~0 4294967296))) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (<= (+ (div ~S~0 4294967296) 1) (div ~s~0 4294967296))) (<= (+ (div ~S~0 4294967296) (div (+ (- 1) ~u~0) 4294967296) (div ~T~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~s~0) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~s~0) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ (div ~S~0 4294967296) (div (+ (- 1) ~u~0) 4294967296) (div ~T~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (<= 0 ~m~0) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (<= (+ (div ~S~0 4294967296) 1) (div ~s~0 4294967296)))) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (<= (+ (div ~S~0 4294967296) 1) (div ~s~0 4294967296))) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~s~0) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)))), 23138#(and (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (<= 0 ~m~0) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)))), 23143#(and (or (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ (* (div ~T~0 4294967296) 4294967296) 1) ~t~0)) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~s~0 ~m~0 (* (div ~T~0 4294967296) 4294967296) 4294967296)) (<= ~s~0 (* (div ~S~0 4294967296) 4294967296))) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ (* (div ~T~0 4294967296) 4294967296) 1) ~t~0) (<= (+ (div ~S~0 4294967296) 2 (div (+ (- 1) ~u~0) 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~s~0 ~m~0 (* (div ~T~0 4294967296) 4294967296) 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ (div ~S~0 4294967296) (div (+ (- 1) ~u~0) 4294967296) (div ~T~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~s~0 ~m~0 (* (div ~T~0 4294967296) 4294967296) 4294967296)) (<= (+ (* (div ~T~0 4294967296) 4294967296) 1) ~t~0)) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div ~U~0 4294967296) 4294967296) ~s~0 ~m~0 (* (div ~T~0 4294967296) 4294967296) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ (div ~S~0 4294967296) 2 (div (+ (- 1) ~u~0) 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (not (<= (+ (div ~m~0 4294967296) 1) 0)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ (* (div ~T~0 4294967296) 4294967296) 1) ~t~0)) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (* (div ~S~0 4294967296) 4294967296) ~s~0)) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (<= 0 ~m~0) (< 0 (mod (+ 4294967295 ~u~0) 4294967296))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= ~s~0 (* (div ~S~0 4294967296) 4294967296))) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967294)))), 23145#(and (or (<= 0 ~m~0) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296)))) (or (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= ~s~0 (* (div ~S~0 4294967296) 4294967296))) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= (+ (div ~S~0 4294967296) (div (+ (- 1) ~u~0) 4294967296) (div ~T~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (* (div ~T~0 4294967296) 4294967296) ~t~0) (<= (+ (div ~S~0 4294967296) 2 (div (+ (- 1) ~u~0) 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (* (div ~T~0 4294967296) 4294967296) ~t~0)) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div ~U~0 4294967296) 4294967296) ~s~0 ~m~0 (* (div ~T~0 4294967296) 4294967296) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= (+ (div ~S~0 4294967296) 2 (div (+ (- 1) ~u~0) 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (* (div ~S~0 4294967296) 4294967296) ~s~0)) (or (not (<= (+ (div ~m~0 4294967296) 1) 0)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (* (div ~T~0 4294967296) 4294967296) ~t~0)) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~s~0 ~m~0 (* (div ~T~0 4294967296) 4294967296) 4294967296)) (<= (* (div ~T~0 4294967296) 4294967296) ~t~0)) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~s~0 ~m~0 (* (div ~T~0 4294967296) 4294967296) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~s~0 ~m~0 (* (div ~T~0 4294967296) 4294967296) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= ~s~0 (* (div ~S~0 4294967296) 4294967296))) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967294)))), 23144#(and (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~s~0 ~m~0 (* (div ~T~0 4294967296) 4294967296) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= ~s~0 (* (div ~S~0 4294967296) 4294967296)) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (* (div ~T~0 4294967296) 4294967296) ~t~0) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= ~s~0 (* (div ~S~0 4294967296) 4294967296)) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= (+ (div ~S~0 4294967296) 2 (div (+ (- 1) ~u~0) 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~s~0 ~m~0 (* (div ~T~0 4294967296) 4294967296) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~s~0 ~m~0 (* (div ~T~0 4294967296) 4294967296) 4294967296)) (<= (* (div ~T~0 4294967296) 4294967296) ~t~0) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (<= 0 ~m~0) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967294)) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div ~U~0 4294967296) 4294967296) ~s~0 ~m~0 (* (div ~T~0 4294967296) 4294967296) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= (+ (div ~S~0 4294967296) (div (+ (- 1) ~u~0) 4294967296) (div ~T~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (* (div ~T~0 4294967296) 4294967296) ~t~0) (<= (+ (div ~S~0 4294967296) 2 (div (+ (- 1) ~u~0) 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (* (div ~S~0 4294967296) 4294967296) ~s~0) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (not (<= (+ (div ~m~0 4294967296) 1) 0)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (* (div ~T~0 4294967296) 4294967296) ~t~0) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0))), 23139#(and (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (<= 0 ~m~0) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= 1 thread1Thread1of1ForFork2_~cond~0)) (or (<= 0 ~m~0) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))), 23140#(and (or (<= 0 ~m~0) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (not (<= (+ (div ~S~0 4294967296) 1) (div ~s~0 4294967296)))) (or (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~s~0) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~s~0) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ (div ~S~0 4294967296) (div ~u~0 4294967296) (div ~T~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (not (<= (+ (div ~S~0 4294967296) 1) (div ~s~0 4294967296))) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (not (<= (+ (div ~S~0 4294967296) 1) (div ~s~0 4294967296))) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~s~0) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (<= 0 ~m~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~s~0) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (not (<= (+ (div ~S~0 4294967296) 1) (div ~s~0 4294967296))) (<= (+ (div ~S~0 4294967296) (div ~u~0 4294967296) (div ~T~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))))] [2022-03-15 19:47:46,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:47:46,395 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:47:46,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:47:46,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1120, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 19:47:46,396 INFO L87 Difference]: Start difference. First operand 1078 states and 3883 transitions. Second operand has 19 states, 18 states have (on average 4.333333333333333) internal successors, (78), 18 states have internal predecessors, (78), 0 states have call successors, (0), 0 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 19:48:02,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:48:02,884 INFO L93 Difference]: Finished difference Result 2838 states and 9834 transitions. [2022-03-15 19:48:02,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-03-15 19:48:02,886 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.333333333333333) internal successors, (78), 18 states have internal predecessors, (78), 0 states have call successors, (0), 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 19:48:02,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:48:02,897 INFO L225 Difference]: With dead ends: 2838 [2022-03-15 19:48:02,897 INFO L226 Difference]: Without dead ends: 2440 [2022-03-15 19:48:02,899 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 77 SyntacticMatches, 31 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2485 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=1020, Invalid=6290, Unknown=0, NotChecked=0, Total=7310 [2022-03-15 19:48:02,899 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 289 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 2342 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 2396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:48:02,900 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [289 Valid, 8 Invalid, 2396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2342 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-03-15 19:48:02,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2440 states. [2022-03-15 19:48:02,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2440 to 1154. [2022-03-15 19:48:02,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 1153 states have (on average 3.624457935819601) internal successors, (4179), 1153 states have internal predecessors, (4179), 0 states have call successors, (0), 0 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 19:48:02,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 4179 transitions. [2022-03-15 19:48:02,947 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 4179 transitions. Word has length 25 [2022-03-15 19:48:02,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:48:02,947 INFO L470 AbstractCegarLoop]: Abstraction has 1154 states and 4179 transitions. [2022-03-15 19:48:02,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.333333333333333) internal successors, (78), 18 states have internal predecessors, (78), 0 states have call successors, (0), 0 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 19:48:02,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 4179 transitions. [2022-03-15 19:48:02,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:48:02,950 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:48:02,950 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:48:02,969 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 19:48:03,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:48:03,166 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 19:48:03,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:48:03,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1602917613, now seen corresponding path program 4 times [2022-03-15 19:48:03,168 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:48:03,168 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309931931] [2022-03-15 19:48:03,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:48:03,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:48:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:48:04,114 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:04,114 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:48:04,115 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309931931] [2022-03-15 19:48:04,115 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309931931] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:48:04,115 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388604853] [2022-03-15 19:48:04,115 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:48:04,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:48:04,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:48:04,116 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 19:48:04,117 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 19:48:04,297 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:48:04,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:48:04,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 19:48:04,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:48:05,255 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:05,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:48:10,111 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:10,111 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388604853] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:48:10,111 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:48:10,111 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27 [2022-03-15 19:48:10,112 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1527124405] [2022-03-15 19:48:10,112 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:48:10,114 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:48:10,144 INFO L252 McrAutomatonBuilder]: Finished intersection with 120 states and 268 transitions. [2022-03-15 19:48:10,144 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:48:35,866 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [28566#(and (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (= 0 (+ (* (- 1) thread1Thread1of1ForFork2_~cond~0) 1)) (< (* (div ~t~0 4294967296) 4294967296) ~t~0) (= thread1Thread1of1ForFork2_~cond~0 0)) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (= 0 (+ (* (- 1) thread1Thread1of1ForFork2_~cond~0) 1)) (< (* (div ~t~0 4294967296) 4294967296) ~t~0) (<= ~s~0 (* (div ~s~0 4294967296) 4294967296))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0) (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296)) (< (* (div ~t~0 4294967296) 4294967296) ~t~0) (<= (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) (* (div ~t~0 4294967296) 4294967296) (* (div ~S~0 4294967296) 4294967296)) (+ ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) (* (div ~T~0 4294967296) 4294967296) 4294967296)) (<= ~s~0 (* (div ~s~0 4294967296) 4294967296))) (or (<= (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) (+ (* (div (+ (* (- 1) ~s~0) ~U~0 ~T~0 ~S~0 (* (div ~t~0 4294967296) (- 4294967296)) (* (- 1) ~m~0)) 4294967296) 4294967296) 4294967295 ~m~0 (* (div ~s~0 4294967296) 4294967296) (* (div ~T~0 4294967296) 4294967296))) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0) (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296)) (< (* (div ~t~0 4294967296) 4294967296) ~t~0) (<= ~s~0 (* (div ~s~0 4294967296) 4294967296))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0) (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296)) (< (* (div ~t~0 4294967296) 4294967296) ~t~0) (<= (+ ~U~0 ~T~0 ~S~0) (+ ~t~0 ~s~0 ~m~0 (* (div ~u~0 4294967296) 4294967296))) (<= ~s~0 (* (div ~s~0 4294967296) 4294967296))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< (* (div ~t~0 4294967296) 4294967296) ~t~0) (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0) (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296)) (< (* (div ~t~0 4294967296) 4294967296) ~t~0) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967294)) (<= ~s~0 (* (div ~s~0 4294967296) 4294967296))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< (* (div ~s~0 4294967296) 4294967296) ~s~0) (< (* (div ~t~0 4294967296) 4294967296) ~t~0) (<= thread1Thread1of1ForFork2_~cond~0 (* (div thread1Thread1of1ForFork2_~cond~0 256) 256))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0) (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296)) (< (* (div ~t~0 4294967296) 4294967296) ~t~0) (<= ~s~0 (* (div ~s~0 4294967296) 4294967296)) (<= (+ (* 8589934592 (div ~t~0 4294967296)) ~s~0 ~m~0 (* (div ~u~0 4294967296) 4294967296)) (+ ~U~0 ~T~0 ~S~0 (* (div ~T~0 4294967296) 4294967296) 4294967296))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= 0 (+ (* (- 1) thread1Thread1of1ForFork2_~cond~0) 1)) (< (* (div ~t~0 4294967296) 4294967296) ~t~0)) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ (* (div ~t~0 4294967296) 4294967296) ~s~0 ~m~0 (* 4294967296 (div (+ (- 1) (* (- 1) ~s~0) ~U~0 ~T~0 ~S~0 (* (- 1) ~m~0) (* (div ~T~0 4294967296) (- 4294967296))) 4294967296))) (+ ~U~0 ~T~0 ~S~0)) (< (* (div ~t~0 4294967296) 4294967296) ~t~0) (<= ~s~0 (* (div ~s~0 4294967296) 4294967296)))), 28564#(and (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))), 28563#(and (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)))), 28569#(and (or (<= (+ ~U~0 ~T~0 ~S~0) (+ ~u~0 ~t~0 ~s~0 ~m~0)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= ~s~0 ~S~0) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) 4294967296) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~s~0)) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ (* (div (+ ~t~0 1) 4294967296) 4294967296) (* (div (+ (* (- 1) ~s~0) (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) (* (- 1) ~u~0) ~U~0 ~T~0 ~S~0 (* (- 1) ~m~0) (* (div ~T~0 4294967296) (- 4294967296))) 4294967296) 4294967296) ~s~0 ~m~0) (+ ~U~0 ~T~0 ~S~0)) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967294)) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~s~0 ~m~0 (* (div (+ ~t~0 1) 4294967296) 8589934592)) (+ ~U~0 ~T~0 ~S~0 (* (div ~T~0 4294967296) 4294967296) 4294967296)) (<= (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) 4294967296) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~s~0)) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= ~s~0 ~S~0) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) (+ 4294967295 ~m~0 (* (div ~s~0 4294967296) 4294967296) (* (div (+ (* (- 1) ~s~0) ~U~0 ~T~0 ~S~0 (* (- 1) ~m~0) (* (div (+ ~t~0 1) 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div ~T~0 4294967296) 4294967296))) (<= (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) 4294967296) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~s~0)) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (* (div ~S~0 4294967296) 4294967296) ~s~0) (<= (+ (* (div (+ ~t~0 1) 4294967296) 4294967296) (* (div (+ (* (- 1) ~s~0) (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) (* (- 1) ~u~0) ~U~0 ~T~0 ~S~0 (* (- 1) ~m~0) (* (div ~T~0 4294967296) (- 4294967296))) 4294967296) 4294967296) ~s~0 ~m~0) (+ ~U~0 ~T~0 ~S~0)) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0) (+ ~u~0 ~t~0 ~s~0 ~m~0)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) 4294967296) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~s~0)) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) (+ 4294967295 ~m~0 (* (div ~s~0 4294967296) 4294967296) (* (div (+ (* (- 1) ~s~0) ~U~0 ~T~0 ~S~0 (* (- 1) ~m~0) (* (div (+ ~t~0 1) 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div ~T~0 4294967296) 4294967296))) (<= (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) 4294967296) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~s~0)) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (* (div ~T~0 4294967296) 4294967296) ~t~0) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= ~s~0 ~S~0) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~s~0 ~m~0 (* (div (+ ~t~0 1) 4294967296) 8589934592)) (+ ~U~0 ~T~0 ~S~0 (* (div ~T~0 4294967296) 4294967296) 4294967296)) (<= (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) 4294967296) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~s~0)) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967294)) (<= (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) 4294967296) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~s~0)) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= (* (div ~S~0 4294967296) 4294967296) ~s~0) (<= (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) 4294967296) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~s~0)) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0))), 28570#(and (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ (* (div (+ ~t~0 1) 4294967296) 4294967296) (* (div (+ (* (- 1) ~s~0) (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) (* (- 1) ~u~0) ~U~0 ~T~0 ~S~0 (* (- 1) ~m~0) (* (div ~T~0 4294967296) (- 4294967296))) 4294967296) 4294967296) ~s~0 ~m~0) (+ ~U~0 ~T~0 ~S~0)) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967294))) (or (<= (+ ~U~0 ~T~0 ~S~0) (+ ~u~0 ~t~0 ~s~0 ~m~0)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= ~s~0 ~S~0) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) 4294967296) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~s~0))) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= ~s~0 ~S~0) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~s~0 ~m~0 (* (div (+ ~t~0 1) 4294967296) 8589934592)) (+ ~U~0 ~T~0 ~S~0 (* (div ~T~0 4294967296) 4294967296) 4294967296)) (<= (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) 4294967296) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~s~0))) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= ~s~0 ~S~0) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) (+ 4294967295 ~m~0 (* (div ~s~0 4294967296) 4294967296) (* (div (+ (* (- 1) ~s~0) ~U~0 ~T~0 ~S~0 (* (- 1) ~m~0) (* (div (+ ~t~0 1) 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div ~T~0 4294967296) 4294967296))) (<= (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) 4294967296) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~s~0))) (or (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0) (+ ~u~0 ~t~0 ~s~0 ~m~0)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) 4294967296) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~s~0))) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (* (div ~S~0 4294967296) 4294967296) ~s~0) (<= (+ (* (div (+ ~t~0 1) 4294967296) 4294967296) (* (div (+ (* (- 1) ~s~0) (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) (* (- 1) ~u~0) ~U~0 ~T~0 ~S~0 (* (- 1) ~m~0) (* (div ~T~0 4294967296) (- 4294967296))) 4294967296) 4294967296) ~s~0 ~m~0) (+ ~U~0 ~T~0 ~S~0))) (or (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) (+ 4294967295 ~m~0 (* (div ~s~0 4294967296) 4294967296) (* (div (+ (* (- 1) ~s~0) ~U~0 ~T~0 ~S~0 (* (- 1) ~m~0) (* (div (+ ~t~0 1) 4294967296) (- 4294967296))) 4294967296) 4294967296) (* (div ~T~0 4294967296) 4294967296))) (<= (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) 4294967296) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~s~0))) (or (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~s~0 ~m~0 (* (div (+ ~t~0 1) 4294967296) 8589934592)) (+ ~U~0 ~T~0 ~S~0 (* (div ~T~0 4294967296) 4294967296) 4294967296)) (<= (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) 4294967296) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~s~0))) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967294)) (<= (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) 4294967296) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~s~0))) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= (* (div ~S~0 4294967296) 4294967296) ~s~0) (<= (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) 4294967296) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~s~0))) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (* (div ~T~0 4294967296) 4294967296) ~t~0))), 28571#(and (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= ~u~0 (* (div ~u~0 4294967296) 4294967296))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (= ~m~0 0)) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ (* 8589934592 (div ~t~0 4294967296)) (* (div ~u~0 4294967296) 4294967296)) (+ ~U~0 ~T~0 (* (div ~T~0 4294967296) 4294967296) 4294967296))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (= (+ (* (- 1) ~s~0) ~S~0) 0)) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ ~U~0 ~T~0) (+ ~u~0 ~t~0))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ (* (div ~t~0 4294967296) 4294967296) (* 4294967296 (div (+ (- 1) (* (- 1) ~u~0) ~U~0 ~T~0 (* (div ~u~0 4294967296) 4294967296) (* (div ~T~0 4294967296) (- 4294967296))) 4294967296))) (+ ~U~0 ~T~0))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ (* (div ~T~0 4294967296) 4294967296) 1) ~t~0))), 28565#(and (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< (* (div ~t~0 4294967296) 4294967296) ~t~0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (+ (* (div ~s~0 4294967296) 4294967296) (* 4294967296 (div ~m~0 4294967296)) 4294967298) (+ ~s~0 ~m~0)) (<= (* (div ~S~0 4294967296) 4294967296) (+ ~s~0 1))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< (div ~s~0 4294967296) (+ (div ~S~0 4294967296) 1)) (< (* (div ~t~0 4294967296) 4294967296) ~t~0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (+ (* (div ~s~0 4294967296) 4294967296) (* 4294967296 (div ~m~0 4294967296)) 4294967298) (+ ~s~0 ~m~0))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< (* (div ~t~0 4294967296) 4294967296) ~t~0) (<= (+ (* (div ~s~0 4294967296) 4294967296) (* 4294967296 (div ~m~0 4294967296)) 4294967298) (+ ~s~0 ~m~0)) (<= (+ ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) 4294967296 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~s~0 ~m~0)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< (* (div ~t~0 4294967296) 4294967296) ~t~0) (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< (div ~s~0 4294967296) (div ~S~0 4294967296)) (<= (+ (* (div ~t~0 4294967296) 4294967296) (* (div ~S~0 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~t~0 ~s~0 ~m~0)) (< (* (div ~t~0 4294967296) 4294967296) ~t~0))), 28567#(and (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= ~u~0 (* (div ~u~0 4294967296) 4294967296))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (* (div ~S~0 4294967296) 4294967296) ~s~0) (<= (+ 4294967295 ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) (* (div ~u~0 4294967296) 4294967296)) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~s~0))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0) (+ ~u~0 ~t~0 ~s~0 ~m~0)) (<= (+ 4294967295 ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) (* (div ~u~0 4294967296) 4294967296)) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~s~0))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ (* (div ~t~0 4294967296) 4294967296) (* (div (+ (- 1) (* (- 1) ~s~0) (* (- 1) ~u~0) ~U~0 ~T~0 ~S~0 (* (div ~u~0 4294967296) 4294967296) (* (- 1) ~m~0) (* (div ~T~0 4294967296) (- 4294967296))) 4294967296) 4294967296) ~s~0 ~m~0) (+ ~U~0 ~T~0 ~S~0)) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967294))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (<= (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) (+ (* (div (+ (* (- 1) ~s~0) ~U~0 ~T~0 ~S~0 (* (div ~t~0 4294967296) (- 4294967296)) (* (- 1) ~m~0)) 4294967296) 4294967296) 4294967295 ~m~0 (* (div ~s~0 4294967296) 4294967296) (* (div ~T~0 4294967296) 4294967296))) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (<= (+ 4294967295 ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) (* (div ~u~0 4294967296) 4294967296)) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~s~0))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967294)) (<= (+ 4294967295 ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) (* (div ~u~0 4294967296) 4294967296)) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~s~0))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (<= (+ 4294967295 ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) (* (div ~u~0 4294967296) 4294967296)) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~s~0)) (<= (+ (* 8589934592 (div ~t~0 4294967296)) ~s~0 ~m~0 (* (div ~u~0 4294967296) 4294967296)) (+ ~U~0 ~T~0 ~S~0 (* (div ~T~0 4294967296) 4294967296) 4294967296))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0) (+ ~u~0 ~t~0 ~s~0 ~m~0)) (<= ~s~0 ~S~0) (<= (+ 4294967295 ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) (* (div ~u~0 4294967296) 4294967296)) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~s~0))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (<= (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) (+ (* (div (+ (* (- 1) ~s~0) ~U~0 ~T~0 ~S~0 (* (div ~t~0 4294967296) (- 4294967296)) (* (- 1) ~m~0)) 4294967296) 4294967296) 4294967295 ~m~0 (* (div ~s~0 4294967296) 4294967296) (* (div ~T~0 4294967296) 4294967296))) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= ~s~0 ~S~0) (<= (+ 4294967295 ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) (* (div ~u~0 4294967296) 4294967296)) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~s~0))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= ~s~0 ~S~0) (<= (+ 4294967295 ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) (* (div ~u~0 4294967296) 4294967296)) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~s~0)) (<= (+ (* 8589934592 (div ~t~0 4294967296)) ~s~0 ~m~0 (* (div ~u~0 4294967296) 4294967296)) (+ ~U~0 ~T~0 ~S~0 (* (div ~T~0 4294967296) 4294967296) 4294967296))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ (* (div ~T~0 4294967296) 4294967296) 1) ~t~0)) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ (* (div ~t~0 4294967296) 4294967296) (* (div (+ (- 1) (* (- 1) ~s~0) (* (- 1) ~u~0) ~U~0 ~T~0 ~S~0 (* (div ~u~0 4294967296) 4294967296) (* (- 1) ~m~0) (* (div ~T~0 4294967296) (- 4294967296))) 4294967296) 4294967296) ~s~0 ~m~0) (+ ~U~0 ~T~0 ~S~0)) (<= (* (div ~S~0 4294967296) 4294967296) ~s~0))), 28568#(and (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= ~s~0 ~S~0) (<= (+ ~U~0 ~T~0 ~S~0 1) (+ ~u~0 ~t~0 ~s~0 ~m~0)) (<= (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) 4294967296) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~s~0))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= ~s~0 ~S~0) (<= (+ (* 8589934592 (div ~t~0 4294967296)) (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~s~0 ~m~0) (+ ~U~0 ~T~0 ~S~0 (* (div ~T~0 4294967296) 4294967296) 4294967296)) (<= (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) 4294967296) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~s~0))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (<= (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) (+ (* (div (+ (* (- 1) ~s~0) ~U~0 ~T~0 ~S~0 (* (div ~t~0 4294967296) (- 4294967296)) (* (- 1) ~m~0)) 4294967296) 4294967296) 4294967295 ~m~0 (* (div ~s~0 4294967296) 4294967296) (* (div ~T~0 4294967296) 4294967296))) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= ~s~0 ~S~0) (<= (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) 4294967296) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~s~0))) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ (* (div ~T~0 4294967296) 4294967296) 1) ~t~0)) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 1) (+ ~u~0 ~t~0 ~s~0 ~m~0)) (<= (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) 4294967296) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~s~0))) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (* (div ~S~0 4294967296) 4294967296) ~s~0) (<= (+ (* (div ~t~0 4294967296) 4294967296) (* (div (+ (* (- 1) ~s~0) (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) (* (- 1) ~u~0) ~U~0 ~T~0 ~S~0 (* (- 1) ~m~0) (* (div ~T~0 4294967296) (- 4294967296))) 4294967296) 4294967296) ~s~0 ~m~0) (+ ~U~0 ~T~0 ~S~0))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (<= (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) (+ (* (div (+ (* (- 1) ~s~0) ~U~0 ~T~0 ~S~0 (* (div ~t~0 4294967296) (- 4294967296)) (* (- 1) ~m~0)) 4294967296) 4294967296) 4294967295 ~m~0 (* (div ~s~0 4294967296) 4294967296) (* (div ~T~0 4294967296) 4294967296))) (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) 4294967296) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~s~0))) (or (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967294)) (<= (+ (* (div ~t~0 4294967296) 4294967296) (* (div (+ (* (- 1) ~s~0) (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) (* (- 1) ~u~0) ~U~0 ~T~0 ~S~0 (* (- 1) ~m~0) (* (div ~T~0 4294967296) (- 4294967296))) 4294967296) 4294967296) ~s~0 ~m~0) (+ ~U~0 ~T~0 ~S~0))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (* (div ~S~0 4294967296) 4294967296) ~s~0) (<= (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) 4294967296) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~s~0))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967294)) (<= (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) 4294967296) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~s~0))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ (* 8589934592 (div ~t~0 4294967296)) (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~s~0 ~m~0) (+ ~U~0 ~T~0 ~S~0 (* (div ~T~0 4294967296) 4294967296) 4294967296)) (<= (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) 4294967296) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~s~0))))] [2022-03-15 19:48:35,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:48:35,867 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:48:35,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:48:35,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1189, Unknown=1, NotChecked=0, Total=1406 [2022-03-15 19:48:35,868 INFO L87 Difference]: Start difference. First operand 1154 states and 4179 transitions. Second operand has 21 states, 20 states have (on average 4.6) internal successors, (92), 20 states have internal predecessors, (92), 0 states have call successors, (0), 0 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 19:49:24,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:49:24,230 INFO L93 Difference]: Finished difference Result 2498 states and 8537 transitions. [2022-03-15 19:49:24,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-03-15 19:49:24,231 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.6) internal successors, (92), 20 states have internal predecessors, (92), 0 states have call successors, (0), 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 19:49:24,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:49:24,248 INFO L225 Difference]: With dead ends: 2498 [2022-03-15 19:49:24,248 INFO L226 Difference]: Without dead ends: 2430 [2022-03-15 19:49:24,249 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 82 SyntacticMatches, 35 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2033 ImplicationChecksByTransitivity, 49.3s TimeCoverageRelationStatistics Valid=880, Invalid=5280, Unknown=2, NotChecked=0, Total=6162 [2022-03-15 19:49:24,250 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 305 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 1873 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:49:24,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [305 Valid, 1 Invalid, 1994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1873 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2022-03-15 19:49:24,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2430 states. [2022-03-15 19:49:24,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2430 to 1194. [2022-03-15 19:49:24,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1194 states, 1193 states have (on average 3.632020117351215) internal successors, (4333), 1193 states have internal predecessors, (4333), 0 states have call successors, (0), 0 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 19:49:24,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 4333 transitions. [2022-03-15 19:49:24,296 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 4333 transitions. Word has length 25 [2022-03-15 19:49:24,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:49:24,296 INFO L470 AbstractCegarLoop]: Abstraction has 1194 states and 4333 transitions. [2022-03-15 19:49:24,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.6) internal successors, (92), 20 states have internal predecessors, (92), 0 states have call successors, (0), 0 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 19:49:24,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 4333 transitions. [2022-03-15 19:49:24,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:49:24,301 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:49:24,301 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:49:24,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-03-15 19:49:24,533 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,SelfDestructingSolverStorable10 [2022-03-15 19:49:24,536 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 19:49:24,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:49:24,536 INFO L85 PathProgramCache]: Analyzing trace with hash 269823500, now seen corresponding path program 5 times [2022-03-15 19:49:24,537 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:49:24,537 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070246772] [2022-03-15 19:49:24,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:24,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:49:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:25,525 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:25,526 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:25,526 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070246772] [2022-03-15 19:49:25,526 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070246772] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:49:25,526 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118979121] [2022-03-15 19:49:25,526 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:49:25,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:25,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:49:25,527 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:49:25,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 19:49:25,737 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:49:25,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:49:25,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-15 19:49:25,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:49:26,526 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:26,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:49:28,681 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:28,682 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118979121] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:49:28,682 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:49:28,682 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 31 [2022-03-15 19:49:28,682 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1872351962] [2022-03-15 19:49:28,682 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:28,685 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:28,699 INFO L252 McrAutomatonBuilder]: Finished intersection with 104 states and 220 transitions. [2022-03-15 19:49:28,699 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:49:41,094 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [33731#(and (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< (* (div ~S~0 4294967296) 4294967296) ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) ~U~0 ~T~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (<= 0 ~m~0) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< (* (div ~S~0 4294967296) 4294967296) ~S~0)) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< 0 (mod ~t~0 4294967296)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))), 33730#(and (or (<= 0 ~m~0) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< (* (div ~S~0 4294967296) 4294967296) ~S~0)) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)))), 33718#(and (or (<= 0 ~m~0) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< (* (div ~S~0 4294967296) 4294967296) ~S~0)) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< (* (div ~S~0 4294967296) 4294967296) ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) ~U~0 ~T~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))), 33719#(and (or (<= 0 ~m~0) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< (* (div ~S~0 4294967296) 4294967296) ~S~0)) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ (* (div ~U~0 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~s~0 ~m~0 (* (div ~u~0 4294967296) 4294967296))) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (< (* (div ~S~0 4294967296) 4294967296) ~S~0)) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< (div ~u~0 4294967296) (+ (div ~U~0 4294967296) 1)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (<= 0 ~m~0) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (not (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (not (<= (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~u~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))))), 33721#(and (or (<= 1 thread1Thread1of1ForFork2_~cond~0) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (* (div ~S~0 4294967296) 4294967296) ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) ~U~0 ~T~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (<= 0 ~m~0) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (* (div ~S~0 4294967296) 4294967296) ~S~0)) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))), 33728#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (<= 0 ~m~0) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< (* (div ~S~0 4294967296) 4294967296) ~S~0)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)))), 33737#(and (or (< 0 (mod (+ 2 ~t~0) 4294967296)) (< 0 (mod (+ 4294967294 ~u~0) 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (< 0 (mod (+ 2 ~t~0) 4294967296)) (<= 0 ~m~0) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)))) (< 0 (mod (+ 4294967294 ~u~0) 4294967296)) (< (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div (+ 2 ~t~0) 4294967296) (div ~S~0 4294967296) (div (+ (- 2) ~u~0) 4294967296) (div ~m~0 4294967296) 1)) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (< 0 (mod (+ 2 ~t~0) 4294967296)) (<= 0 ~m~0) (< 0 (mod (+ 4294967294 ~u~0) 4294967296)) (< (* (div ~S~0 4294967296) 4294967296) ~S~0) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (< 0 (mod (+ 2 ~t~0) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (< 0 (mod (+ 4294967294 ~u~0) 4294967296)) (< (div (+ (- 2) ~u~0) 4294967296) (+ (div ~U~0 4294967296) 1)) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (< 0 (mod (+ 2 ~t~0) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (< 0 (mod (+ 4294967294 ~u~0) 4294967296)) (< (* (div ~S~0 4294967296) 4294967296) ~S~0) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (< 0 (mod (+ 2 ~t~0) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (< 0 (mod (+ 4294967294 ~u~0) 4294967296)) (<= (+ (* (div ~U~0 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) (* (div (+ (- 2) ~u~0) 4294967296) 4294967296) ~s~0 ~m~0)) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0))), 33717#(and (or (<= 0 ~m~0) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< (* (div ~S~0 4294967296) 4294967296) ~S~0)) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)))), 33734#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (< (* (div ~S~0 4294967296) 4294967296) ~S~0)) (or (<= 0 ~m~0) (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (< (* (div ~S~0 4294967296) 4294967296) ~S~0)) (or (<= 0 ~m~0) (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (< (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div (+ (- 1) ~u~0) 4294967296) (div ~m~0 4294967296) 1)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))))) (or (< 0 (mod ~t~0 4294967296)) (<= (+ (* (div ~U~0 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~s~0 ~m~0)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (< (div (+ (- 1) ~u~0) 4294967296) (+ (div ~U~0 4294967296) 1)))), 33722#(and (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (<= 0 ~m~0) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (* (div ~S~0 4294967296) 4294967296) ~S~0))), 33723#(and (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (* (div ~S~0 4294967296) 4294967296) ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) ~U~0 ~T~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= 0 ~m~0) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (* (div ~S~0 4294967296) 4294967296) ~S~0))), 33736#(and (or (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967294 ~u~0) 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (<= 0 ~m~0) (< 0 (mod (+ ~t~0 1) 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)))) (< 0 (mod (+ 4294967294 ~u~0) 4294967296)) (< (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div (+ ~t~0 1) 4294967296) (div ~S~0 4294967296) (div (+ (- 2) ~u~0) 4294967296) (div ~m~0 4294967296) 1))) (or (< 0 (mod (+ ~t~0 1) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (< 0 (mod (+ 4294967294 ~u~0) 4294967296)) (<= (+ (* (div ~U~0 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) (* (div (+ (- 2) ~u~0) 4294967296) 4294967296) ~s~0 ~m~0))) (or (< 0 (mod (+ ~t~0 1) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (< 0 (mod (+ 4294967294 ~u~0) 4294967296)) (< (div (+ (- 2) ~u~0) 4294967296) (+ (div ~U~0 4294967296) 1))) (or (< 0 (mod (+ ~t~0 1) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (< 0 (mod (+ 4294967294 ~u~0) 4294967296)) (< (* (div ~S~0 4294967296) 4294967296) ~S~0)) (or (<= 0 ~m~0) (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967294 ~u~0) 4294967296)) (< (* (div ~S~0 4294967296) 4294967296) ~S~0))), 33729#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< (* (div ~S~0 4294967296) 4294967296) ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) ~U~0 ~T~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (< 0 (mod ~t~0 4294967296)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (<= 0 ~m~0) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< (* (div ~S~0 4294967296) 4294967296) ~S~0)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)))), 33725#(and (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (div ~u~0 4294967296) (+ (div ~U~0 4294967296) 1)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (<= 0 ~m~0) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (* (div ~S~0 4294967296) 4294967296) ~S~0)) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (< (* (div ~S~0 4294967296) 4294967296) ~S~0)) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* (div ~U~0 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~s~0 ~m~0 (* (div ~u~0 4294967296) 4294967296))) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (<= 0 ~m~0) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (not (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (not (<= (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~u~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))))), 33732#(and (or (< 0 (mod ~t~0 4294967296)) (<= (+ (* (div ~U~0 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~s~0 ~m~0 (* (div ~u~0 4294967296) 4294967296))) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (<= 0 ~m~0) (< 0 (mod ~t~0 4294967296)) (not (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (< 0 (mod ~u~0 4294967296)) (not (<= (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~u~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (< (* (div ~S~0 4294967296) 4294967296) ~S~0)) (or (< 0 (mod ~t~0 4294967296)) (< (div ~u~0 4294967296) (+ (div ~U~0 4294967296) 1)) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (<= 0 ~m~0) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< (* (div ~S~0 4294967296) 4294967296) ~S~0)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)))), 33724#(and (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (< (* (div ~S~0 4294967296) 4294967296) ~S~0)) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* (div ~U~0 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~s~0 ~m~0 (* (div ~u~0 4294967296) 4294967296))) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (<= 0 ~m~0) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (* (div ~S~0 4294967296) 4294967296) ~S~0)) (or (<= 0 ~m~0) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (not (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (not (<= (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~u~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (div ~u~0 4294967296) (+ (div ~U~0 4294967296) 1)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)))), 33735#(and (or (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (<= 0 ~m~0) (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)))) (< (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div (+ ~t~0 1) 4294967296) (div ~S~0 4294967296) (div (+ (- 1) ~u~0) 4294967296) (div ~m~0 4294967296) 1)) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (< (* (div ~S~0 4294967296) 4294967296) ~S~0) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (< (div (+ (- 1) ~u~0) 4294967296) (+ (div ~U~0 4294967296) 1)) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (<= 0 ~m~0) (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (< (* (div ~S~0 4294967296) 4294967296) ~S~0) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (<= (+ (* (div ~U~0 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~s~0 ~m~0)) (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0))), 33738#(and (or (< 0 (mod (+ 2 ~t~0) 4294967296)) (<= 0 ~m~0) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)))) (< 0 (mod (+ 4294967294 ~u~0) 4294967296)) (< (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div (+ 2 ~t~0) 4294967296) (div ~S~0 4294967296) (div (+ (- 2) ~u~0) 4294967296) (div ~m~0 4294967296) 1))) (or (< 0 (mod (+ 2 ~t~0) 4294967296)) (<= 0 ~m~0) (< 0 (mod (+ 4294967294 ~u~0) 4294967296)) (< (* (div ~S~0 4294967296) 4294967296) ~S~0)) (or (< 0 (mod (+ 2 ~t~0) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (< 0 (mod (+ 4294967294 ~u~0) 4294967296)) (< (div (+ (- 2) ~u~0) 4294967296) (+ (div ~U~0 4294967296) 1))) (or (< 0 (mod (+ 2 ~t~0) 4294967296)) (< 0 (mod (+ 4294967294 ~u~0) 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (< 0 (mod (+ 2 ~t~0) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (< 0 (mod (+ 4294967294 ~u~0) 4294967296)) (< (* (div ~S~0 4294967296) 4294967296) ~S~0)) (or (< 0 (mod (+ 2 ~t~0) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (< 0 (mod (+ 4294967294 ~u~0) 4294967296)) (<= (+ (* (div ~U~0 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) (* (div (+ (- 2) ~u~0) 4294967296) 4294967296) ~s~0 ~m~0)))), 33733#(and (or (<= 0 ~m~0) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< (* (div ~S~0 4294967296) 4294967296) ~S~0)) (or (<= 0 ~m~0) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< 0 (mod ~t~0 4294967296)) (not (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (< 0 (mod ~u~0 4294967296)) (not (<= (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~u~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< 0 (mod ~t~0 4294967296)) (< (div ~u~0 4294967296) (+ (div ~U~0 4294967296) 1)) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< 0 (mod ~t~0 4294967296)) (<= (+ (* (div ~U~0 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296) (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~s~0 ~m~0 (* (div ~u~0 4294967296) 4294967296))) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (< (* (div ~S~0 4294967296) 4294967296) ~S~0))), 33726#(and (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ ~U~0 ~T~0) (+ (* (div ~t~0 4294967296) 4294967296) (* (div ~u~0 4294967296) 4294967296)))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (= ~m~0 0)) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (= ~s~0 ~S~0)) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (<= (+ (* (div ~U~0 4294967296) 4294967296) ~U~0 ~T~0) (+ (* (div ~t~0 4294967296) 4294967296) (* (div (+ (* (- 1) ~S~0) (* (div ~S~0 4294967296) 4294967296) 4294967295 (* (div ~u~0 4294967296) 4294967296)) 4294967296) 4294967296) (* (div ~u~0 4294967296) 4294967296)))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ (* (div ~t~0 4294967296) 4294967296) (* (div ~u~0 4294967296) 4294967296)) (+ ~U~0 ~T~0))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (< (div ~u~0 4294967296) (+ (div ~U~0 4294967296) 1)))), 33727#(and (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~U~0 ~T~0) (+ (* (div ~t~0 4294967296) 4294967296) (* (div ~u~0 4294967296) 4294967296)))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (not (<= ~t~0 (* (div ~t~0 4294967296) 4294967296))) (= (* (- 1) thread2Thread1of1ForFork0_~cond~1) 0) (not (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)))) (or (= (+ (* (- 1) thread2Thread1of1ForFork0_~cond~1) 1) 0) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (= ~m~0 0)) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* (div ~U~0 4294967296) 4294967296) ~U~0 ~T~0) (+ (* (div ~t~0 4294967296) 4294967296) (* (div (+ (* (- 1) ~S~0) (* (div ~S~0 4294967296) 4294967296) 4294967295 (* (div ~u~0 4294967296) 4294967296)) 4294967296) 4294967296) (* (div ~u~0 4294967296) 4294967296)))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (div ~u~0 4294967296) (+ (div ~U~0 4294967296) 1))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (= ~s~0 ~S~0)) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* (div ~t~0 4294967296) 4294967296) (* (div ~u~0 4294967296) 4294967296)) (+ ~U~0 ~T~0))) (or (= (+ (* (- 1) thread2Thread1of1ForFork0_~cond~1) 1) 0) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)))), 33720#(and (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (<= 0 ~m~0) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (* (div ~S~0 4294967296) 4294967296) ~S~0)))] [2022-03-15 19:49:41,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 19:49:41,095 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:49:41,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 19:49:41,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=2533, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 19:49:41,096 INFO L87 Difference]: Start difference. First operand 1194 states and 4333 transitions. Second operand has 34 states, 33 states have (on average 3.696969696969697) internal successors, (122), 33 states have internal predecessors, (122), 0 states have call successors, (0), 0 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 19:50:14,622 WARN L228 SmtUtils]: Spent 9.09s on a formula simplification. DAG size of input: 113 DAG size of output: 94 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 19:50:54,611 WARN L228 SmtUtils]: Spent 6.87s on a formula simplification. DAG size of input: 142 DAG size of output: 109 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 19:51:53,368 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 19:52:23,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:52:23,824 INFO L93 Difference]: Finished difference Result 4463 states and 15664 transitions. [2022-03-15 19:52:23,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2022-03-15 19:52:23,824 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.696969696969697) internal successors, (122), 33 states have internal predecessors, (122), 0 states have call successors, (0), 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 19:52:23,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:52:23,837 INFO L225 Difference]: With dead ends: 4463 [2022-03-15 19:52:23,837 INFO L226 Difference]: Without dead ends: 4364 [2022-03-15 19:52:23,843 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 75 SyntacticMatches, 9 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18769 ImplicationChecksByTransitivity, 151.6s TimeCoverageRelationStatistics Valid=6804, Invalid=44045, Unknown=1, NotChecked=0, Total=50850 [2022-03-15 19:52:23,844 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1217 mSDsluCounter, 1702 mSDsCounter, 0 mSdLazyCounter, 4461 mSolverCounterSat, 570 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 570 IncrementalHoareTripleChecker+Valid, 4461 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:52:23,844 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1217 Valid, 0 Invalid, 5032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [570 Valid, 4461 Invalid, 1 Unknown, 0 Unchecked, 15.8s Time] [2022-03-15 19:52:23,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4364 states. [2022-03-15 19:52:23,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4364 to 1402. [2022-03-15 19:52:23,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1402 states, 1401 states have (on average 3.667380442541042) internal successors, (5138), 1401 states have internal predecessors, (5138), 0 states have call successors, (0), 0 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 19:52:23,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 5138 transitions. [2022-03-15 19:52:23,923 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 5138 transitions. Word has length 25 [2022-03-15 19:52:23,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:52:23,923 INFO L470 AbstractCegarLoop]: Abstraction has 1402 states and 5138 transitions. [2022-03-15 19:52:23,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.696969696969697) internal successors, (122), 33 states have internal predecessors, (122), 0 states have call successors, (0), 0 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 19:52:23,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 5138 transitions. [2022-03-15 19:52:23,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:52:23,926 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:52:23,926 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:52:23,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 19:52:24,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:52:24,153 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 19:52:24,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:52:24,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1036342132, now seen corresponding path program 6 times [2022-03-15 19:52:24,154 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:52:24,154 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082421767] [2022-03-15 19:52:24,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:52:24,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:52:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:52:24,203 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:52:24,204 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:52:24,204 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082421767] [2022-03-15 19:52:24,204 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082421767] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:52:24,204 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043390583] [2022-03-15 19:52:24,204 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:52:24,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:52:24,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:52:24,220 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:52:24,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 19:52:24,325 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 19:52:24,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:52:24,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 19:52:24,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:52:24,441 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:52:24,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:52:24,561 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:52:24,561 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043390583] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:52:24,562 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:52:24,562 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 7] total 11 [2022-03-15 19:52:24,562 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2057831852] [2022-03-15 19:52:24,562 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:52:24,564 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:52:24,573 INFO L252 McrAutomatonBuilder]: Finished intersection with 86 states and 166 transitions. [2022-03-15 19:52:24,574 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:52:24,986 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [41472#(or (not (<= ~u~0 (* (div ~u~0 4294967296) 4294967296))) (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)), 41504#(not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)), 41503#(not (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)), 41506#(< 0 (mod (+ 4294967295 ~u~0) 4294967296)), 41505#(or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (not (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)))] [2022-03-15 19:52:24,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:52:24,986 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:52:24,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:52:24,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-03-15 19:52:24,987 INFO L87 Difference]: Start difference. First operand 1402 states and 5138 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 0 states have call successors, (0), 0 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 19:52:25,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:52:25,359 INFO L93 Difference]: Finished difference Result 1774 states and 6518 transitions. [2022-03-15 19:52:25,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 19:52:25,360 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 0 states have call successors, (0), 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 19:52:25,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:52:25,364 INFO L225 Difference]: With dead ends: 1774 [2022-03-15 19:52:25,364 INFO L226 Difference]: Without dead ends: 1772 [2022-03-15 19:52:25,365 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 101 SyntacticMatches, 8 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2022-03-15 19:52:25,367 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 117 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:52:25,367 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 0 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:52:25,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1772 states. [2022-03-15 19:52:25,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1772 to 1064. [2022-03-15 19:52:25,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 1063 states have (on average 3.7036688617121354) internal successors, (3937), 1063 states have internal predecessors, (3937), 0 states have call successors, (0), 0 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 19:52:25,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 3937 transitions. [2022-03-15 19:52:25,394 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 3937 transitions. Word has length 25 [2022-03-15 19:52:25,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:52:25,395 INFO L470 AbstractCegarLoop]: Abstraction has 1064 states and 3937 transitions. [2022-03-15 19:52:25,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 0 states have call successors, (0), 0 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 19:52:25,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 3937 transitions. [2022-03-15 19:52:25,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:52:25,397 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:52:25,397 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:52:25,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-03-15 19:52:25,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 19:52:25,613 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 19:52:25,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:52:25,614 INFO L85 PathProgramCache]: Analyzing trace with hash 515759763, now seen corresponding path program 7 times [2022-03-15 19:52:25,615 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:52:25,615 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651688227] [2022-03-15 19:52:25,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:52:25,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:52:25,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:52:26,533 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:52:26,533 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:52:26,533 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651688227] [2022-03-15 19:52:26,533 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651688227] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:52:26,534 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040946329] [2022-03-15 19:52:26,534 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:52:26,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:52:26,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:52:26,535 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:52:26,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 19:52:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:52:26,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 19:52:26,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:52:27,754 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:52:27,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:52:30,163 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:52:30,163 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040946329] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:52:30,163 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:52:30,163 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-03-15 19:52:30,164 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [36375249] [2022-03-15 19:52:30,164 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:52:30,166 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:52:30,178 INFO L252 McrAutomatonBuilder]: Finished intersection with 100 states and 210 transitions. [2022-03-15 19:52:30,178 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:52:39,698 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [45605#(and (or (<= (+ ~T~0 ~S~0) (+ ~s~0 (* (div ~T~0 4294967296) 4294967296) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296)))) (or (<= 0 ~m~0) (< (div (+ ~t~0 1) 4294967296) (+ (div ~T~0 4294967296) 1))) (= ~u~0 ~U~0) (<= (* (div ~T~0 4294967296) 4294967296) ~t~0) (or (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= (div ~S~0 4294967296) (div ~s~0 4294967296))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= (+ ~t~0 ~s~0 ~m~0) (+ ~T~0 ~S~0))) (or (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ ~t~0 1) 4294967296))) (<= 1 ~m~0))), 45606#(and (or (not (<= (+ (div ~m~0 4294967296) 1) 0)) (not (<= (div ~U~0 4294967296) (div (+ (- 1) ~u~0) 4294967296))) (< (div ~t~0 4294967296) (+ (div ~T~0 4294967296) 1)) (<= (+ (div ~s~0 4294967296) (div (+ (- 1) ~u~0) 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (<= (* (div ~U~0 4294967296) 4294967296) ~u~0) (or (<= (+ ~U~0 ~T~0 ~S~0) (+ 4294967295 ~u~0 ~s~0 ~m~0 (* (div ~T~0 4294967296) 4294967296))) (< (div ~t~0 4294967296) (+ (div ~T~0 4294967296) 1)) (<= (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~m~0))) (or (not (<= (+ (div ~m~0 4294967296) 1) 0)) (not (<= (div ~U~0 4294967296) (div (+ (- 1) ~u~0) 4294967296))) (<= (+ ~U~0 ~T~0 ~S~0) (+ 4294967295 ~u~0 ~s~0 ~m~0 (* (div ~T~0 4294967296) 4294967296))) (< (div ~t~0 4294967296) (+ (div ~T~0 4294967296) 1)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (not (<= (div ~U~0 4294967296) (div (+ (- 1) ~u~0) 4294967296))) (< (div ~t~0 4294967296) (+ (div ~T~0 4294967296) 1)) (<= (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) 2 ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (< (div ~t~0 4294967296) (+ (div ~T~0 4294967296) 1)) (<= (+ (div ~s~0 4294967296) (div (+ (- 1) ~u~0) 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (<= (+ (* (div (+ (- 1) ~u~0) 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~m~0))) (or (not (<= (div ~U~0 4294967296) (div (+ (- 1) ~u~0) 4294967296))) (<= (+ (* (div ~T~0 4294967296) 4294967296) 1) ~t~0)) (< (div (+ (- 1) ~u~0) 4294967296) (+ (div ~U~0 4294967296) 1)) (or (not (<= (+ (div ~m~0 4294967296) 1) 0)) (not (<= (div ~U~0 4294967296) (div (+ (- 1) ~u~0) 4294967296))) (< (div ~t~0 4294967296) (+ (div ~T~0 4294967296) 1)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))))] [2022-03-15 19:52:39,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 19:52:39,698 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:52:39,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 19:52:39,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2022-03-15 19:52:39,699 INFO L87 Difference]: Start difference. First operand 1064 states and 3937 transitions. Second operand has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 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 19:52:42,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:52:42,839 INFO L93 Difference]: Finished difference Result 2027 states and 7244 transitions. [2022-03-15 19:52:42,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 19:52:42,840 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 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 19:52:42,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:52:42,845 INFO L225 Difference]: With dead ends: 2027 [2022-03-15 19:52:42,845 INFO L226 Difference]: Without dead ends: 1786 [2022-03-15 19:52:42,845 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 73 SyntacticMatches, 33 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=347, Invalid=1375, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 19:52:42,847 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 137 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:52:42,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 1 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 19:52:42,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states. [2022-03-15 19:52:42,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1124. [2022-03-15 19:52:42,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 1123 states have (on average 3.669634906500445) internal successors, (4121), 1123 states have internal predecessors, (4121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:42,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 4121 transitions. [2022-03-15 19:52:42,870 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 4121 transitions. Word has length 25 [2022-03-15 19:52:42,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:52:42,871 INFO L470 AbstractCegarLoop]: Abstraction has 1124 states and 4121 transitions. [2022-03-15 19:52:42,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 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 19:52:42,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 4121 transitions. [2022-03-15 19:52:42,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:52:42,873 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:52:42,873 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:52:42,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-03-15 19:52:43,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 19:52:43,092 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 19:52:43,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:52:43,092 INFO L85 PathProgramCache]: Analyzing trace with hash 2072530781, now seen corresponding path program 8 times [2022-03-15 19:52:43,093 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:52:43,093 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529594267] [2022-03-15 19:52:43,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:52:43,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:52:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:52:44,267 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:52:44,267 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:52:44,267 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529594267] [2022-03-15 19:52:44,267 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529594267] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:52:44,267 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939327811] [2022-03-15 19:52:44,267 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:52:44,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:52:44,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:52:44,268 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:52:44,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 19:52:44,611 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:52:44,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:52:44,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 19:52:44,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:52:46,148 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:52:46,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:52:51,726 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:52:51,726 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939327811] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:52:51,726 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:52:51,727 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 28 [2022-03-15 19:52:51,727 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [20456741] [2022-03-15 19:52:51,727 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:52:51,729 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:52:51,742 INFO L252 McrAutomatonBuilder]: Finished intersection with 112 states and 236 transitions. [2022-03-15 19:52:51,742 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:53:15,004 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [50086#(and (or (not (<= (+ (div ~m~0 4294967296) 1) 0)) (not (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0))) (or (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (not (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0))) (or (not (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div ~U~0 4294967296) 4294967296) (* (div ~S~0 4294967296) 4294967296) ~m~0 (* (div ~T~0 4294967296) 4294967296) 4294967296)) (not (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0))) (or (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (not (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0))) (or (not (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div ~U~0 4294967296) 4294967296) (* (div ~S~0 4294967296) 4294967296) (* (div ~T~0 4294967296) 4294967296) 8589934591)))), 50088#(and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div ~U~0 4294967296) 4294967296) (* (div ~S~0 4294967296) 4294967296) (* (div ~T~0 4294967296) 4294967296) 8589934591))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div ~U~0 4294967296) 4294967296) (* (div ~S~0 4294967296) 4294967296) (* (div ~T~0 4294967296) 4294967296) 8589934591))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div ~U~0 4294967296) 4294967296) (* (div ~S~0 4294967296) 4294967296) ~m~0 (* (div ~T~0 4294967296) 4294967296) 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* (div (+ ~m~0 1) 4294967296) 4294967296)))) (or (not (<= (+ (div ~m~0 4294967296) 1) 0)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (not (<= (+ (div (+ ~m~0 1) 4294967296) 1) 0))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (< 0 (mod ~t~0 4294967296)) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (<= (+ (div (+ ~m~0 1) 4294967296) (div ~S~0 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod ~t~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div ~U~0 4294967296) 4294967296) (* (div ~S~0 4294967296) 4294967296) ~m~0 4294967297 (* (div ~T~0 4294967296) 4294967296))) (< 0 (mod ~u~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod ~t~0 4294967296)) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (< 0 (mod ~u~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0))), 50087#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (< 0 (mod ~t~0 4294967296)) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))) (or (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))) (or (not (<= (+ (div ~m~0 4294967296) 1) 0)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div ~U~0 4294967296) 4294967296) (* (div ~S~0 4294967296) 4294967296) (* (div ~T~0 4294967296) 4294967296) 8589934591))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div ~U~0 4294967296) 4294967296) (* (div ~S~0 4294967296) 4294967296) ~m~0 (* (div ~T~0 4294967296) 4294967296) 4294967296)))), 50089#(and (or (not (<= ~U~0 (* (div ~U~0 4294967296) 4294967296))) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (<= (* (div ~U~0 4294967296) 4294967296) (+ ~u~0 1))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (not (< 0 (mod ~s~0 4294967296))) (not (<= (+ ~U~0 ~T~0 ~S~0 (* (div (+ ~m~0 1) 4294967296) 4294967296)) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0 1))) (<= ~U~0 (* (div ~U~0 4294967296) 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (not (<= (+ (div (+ ~m~0 1) 4294967296) 1) 0)) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) 2 (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (<= ~U~0 (* (div ~U~0 4294967296) 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (not (< 0 (mod ~s~0 4294967296))) (<= (+ (* (div ~U~0 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div (+ ~m~0 1) 4294967296) 4294967296)) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~m~0 1)) (<= (+ ~U~0 ~T~0 ~S~0) (+ ~u~0 ~s~0 ~m~0 (* (div ~T~0 4294967296) 4294967296) 4294967296)) (<= ~U~0 (* (div ~U~0 4294967296) 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (<= (+ ~U~0 ~T~0 ~S~0 (* (div (+ ~m~0 1) 4294967296) 4294967296)) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0 1))) (or (<= (mod ~s~0 4294967296) 0) (< (div ~t~0 4294967296) (+ (div ~T~0 4294967296) 1)) (<= ~U~0 (* (div ~U~0 4294967296) 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) 2 (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* (div (+ ~m~0 1) 4294967296) 4294967296)))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (not (< 0 (mod ~s~0 4294967296))) (<= (+ (* (div ~U~0 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div (+ ~m~0 1) 4294967296) 4294967296)) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~m~0 1)) (<= ~U~0 (* (div ~U~0 4294967296) 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (<= (+ ~U~0 ~T~0 ~S~0 (* (div (+ ~m~0 1) 4294967296) 4294967296)) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0 1)) (not (<= (+ (div ~S~0 4294967296) 1) (div (+ (- 1) ~s~0) 4294967296)))) (or (< (div ~u~0 4294967296) (+ (div ~U~0 4294967296) 1)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (not (< 0 (mod ~s~0 4294967296))) (<= ~U~0 (* (div ~U~0 4294967296) 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (<= (+ (div (+ ~m~0 1) 4294967296) (div ~S~0 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div ~S~0 4294967296) 4294967296) ~u~0 (* (div ~T~0 4294967296) 4294967296) 8589934591)) (< (div ~t~0 4294967296) (+ (div ~T~0 4294967296) 1)) (< (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~U~0 4294967296) 2 (div ~T~0 4294967296))) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (<= (+ ~U~0 ~T~0 ~S~0) (+ ~u~0 ~s~0 ~m~0 (* (div ~T~0 4294967296) 4294967296) 4294967296)) (<= ~U~0 (* (div ~U~0 4294967296) 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (not (<= (+ (div (+ ~m~0 1) 4294967296) 1) 0)) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) 2 (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (not (<= (+ (div ~m~0 4294967296) 1) 0)) (not (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (< 0 (mod ~s~0 4294967296)) (<= ~U~0 (* (div ~U~0 4294967296) 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) 2 (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (<= (+ (* (div ~T~0 4294967296) 4294967296) 1) ~t~0) (<= ~U~0 (* (div ~U~0 4294967296) 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (not (<= (+ (div ~m~0 4294967296) 1) 0)) (not (<= (+ (div ~S~0 4294967296) 1) (div ~s~0 4294967296))) (< 0 (mod ~s~0 4294967296)) (<= ~U~0 (* (div ~U~0 4294967296) 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) 2 (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (< (div ~t~0 4294967296) (+ (div ~T~0 4294967296) 1)) (< 0 (mod ~s~0 4294967296)) (<= ~U~0 (* (div ~U~0 4294967296) 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) 2 (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (<= ~U~0 (* (div ~U~0 4294967296) 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (not (<= (+ (div (+ ~m~0 1) 4294967296) 1) 0)) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) 2 (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (not (<= (+ (div ~S~0 4294967296) 1) (div (+ (- 1) ~s~0) 4294967296)))) (or (not (<= ~U~0 (* (div ~U~0 4294967296) 4294967296))) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (not (<= (div ~U~0 4294967296) (div ~u~0 4294967296)))) (or (< (div ~t~0 4294967296) (+ (div ~T~0 4294967296) 1)) (< 0 (mod ~s~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= ~U~0 (* (div ~U~0 4294967296) 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (<= (+ (* (div ~U~0 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~m~0)))), 50090#(and (or (= ~u~0 ~U~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (not (< 0 (mod ~s~0 4294967296))) (not (<= (+ ~U~0 ~T~0 ~S~0 (* (div (+ ~m~0 1) 4294967296) 4294967296)) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0 1))) (<= ~U~0 (* (div ~U~0 4294967296) 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (not (<= (+ (div (+ ~m~0 1) 4294967296) 1) 0)) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) 2 (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (<= (+ (* (div ~U~0 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div (+ ~m~0 1) 4294967296) 4294967296)) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~m~0)) (not (< 0 (mod ~s~0 4294967296))) (<= ~U~0 (* (div ~U~0 4294967296) 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (not (<= (+ (div ~S~0 4294967296) 1) (div (+ (- 1) ~s~0) 4294967296)))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (<= ~U~0 (* (div ~U~0 4294967296) 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (<= (+ (* (div ~U~0 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* (div (+ ~m~0 1) 4294967296) 4294967296)) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~m~0)) (not (< 0 (mod ~s~0 4294967296))) (<= (+ ~U~0 ~T~0 ~S~0) (+ 4294967295 ~u~0 ~s~0 ~m~0 (* (div ~T~0 4294967296) 4294967296))) (<= ~U~0 (* (div ~U~0 4294967296) 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< (div ~t~0 4294967296) (+ (div ~T~0 4294967296) 1)) (< 0 (mod ~s~0 4294967296)) (<= ~U~0 (* (div ~U~0 4294967296) 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (<= (+ (* (div ~U~0 4294967296) 4294967296) ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 ~m~0))) (or (<= (mod ~s~0 4294967296) 0) (< (div ~t~0 4294967296) (+ (div ~T~0 4294967296) 1)) (<= ~U~0 (* (div ~U~0 4294967296) 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) 2 (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* (div (+ ~m~0 1) 4294967296) 4294967296)))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (<= (+ ~U~0 ~T~0 ~S~0) (+ 4294967295 ~u~0 ~s~0 ~m~0 (* (div ~T~0 4294967296) 4294967296))) (<= ~U~0 (* (div ~U~0 4294967296) 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (not (<= (+ (div (+ ~m~0 1) 4294967296) 1) 0)) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) 2 (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (not (< 0 (mod ~s~0 4294967296))) (<= ~U~0 (* (div ~U~0 4294967296) 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (<= (+ (div (+ ~m~0 1) 4294967296) (div ~S~0 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (not (<= (+ (div ~m~0 4294967296) 1) 0)) (not (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (< 0 (mod ~s~0 4294967296)) (<= ~U~0 (* (div ~U~0 4294967296) 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) 2 (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (<= (+ (* (div ~T~0 4294967296) 4294967296) 1) ~t~0) (<= ~U~0 (* (div ~U~0 4294967296) 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (not (<= (+ (div ~m~0 4294967296) 1) 0)) (not (<= (+ (div ~S~0 4294967296) 1) (div ~s~0 4294967296))) (< 0 (mod ~s~0 4294967296)) (<= ~U~0 (* (div ~U~0 4294967296) 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) 2 (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (< (div ~t~0 4294967296) (+ (div ~T~0 4294967296) 1)) (< 0 (mod ~s~0 4294967296)) (<= ~U~0 (* (div ~U~0 4294967296) 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) 2 (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (<= ~U~0 (* (div ~U~0 4294967296) 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (not (<= (+ (div (+ ~m~0 1) 4294967296) 1) 0)) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) 2 (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (not (<= (+ (div ~S~0 4294967296) 1) (div (+ (- 1) ~s~0) 4294967296)))))] [2022-03-15 19:53:15,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:53:15,004 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:53:15,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:53:15,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=941, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 19:53:15,005 INFO L87 Difference]: Start difference. First operand 1124 states and 4121 transitions. Second operand has 15 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 0 states have call successors, (0), 0 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 19:53:27,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:53:27,753 INFO L93 Difference]: Finished difference Result 2582 states and 8903 transitions. [2022-03-15 19:53:27,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 19:53:27,753 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 0 states have call successors, (0), 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 19:53:27,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:53:27,759 INFO L225 Difference]: With dead ends: 2582 [2022-03-15 19:53:27,759 INFO L226 Difference]: Without dead ends: 2266 [2022-03-15 19:53:27,759 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 55 SyntacticMatches, 56 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1946 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=660, Invalid=2419, Unknown=1, NotChecked=0, Total=3080 [2022-03-15 19:53:27,760 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 318 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:53:27,760 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [318 Valid, 0 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 19:53:27,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2266 states. [2022-03-15 19:53:27,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2266 to 1138. [2022-03-15 19:53:27,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 1137 states have (on average 3.6631486367634123) internal successors, (4165), 1137 states have internal predecessors, (4165), 0 states have call successors, (0), 0 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 19:53:27,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 4165 transitions. [2022-03-15 19:53:27,808 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 4165 transitions. Word has length 25 [2022-03-15 19:53:27,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:53:27,808 INFO L470 AbstractCegarLoop]: Abstraction has 1138 states and 4165 transitions. [2022-03-15 19:53:27,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 0 states have call successors, (0), 0 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 19:53:27,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 4165 transitions. [2022-03-15 19:53:27,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:53:27,811 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:53:27,811 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:53:27,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 19:53:28,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 19:53:28,015 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:53:28,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:53:28,016 INFO L85 PathProgramCache]: Analyzing trace with hash 418222911, now seen corresponding path program 2 times [2022-03-15 19:53:28,016 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:53:28,016 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129899683] [2022-03-15 19:53:28,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:53:28,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:53:28,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:53:29,261 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:53:29,261 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:53:29,261 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129899683] [2022-03-15 19:53:29,261 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129899683] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:53:29,261 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629120198] [2022-03-15 19:53:29,261 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:53:29,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:53:29,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:53:29,262 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:53:29,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 19:53:29,366 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:53:29,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:53:29,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 19:53:29,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:53:30,298 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:53:30,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:53:31,520 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:53:31,521 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629120198] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:53:31,521 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:53:31,521 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 29 [2022-03-15 19:53:31,521 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2119865183] [2022-03-15 19:53:31,521 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:53:31,523 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:53:31,534 INFO L252 McrAutomatonBuilder]: Finished intersection with 90 states and 182 transitions. [2022-03-15 19:53:31,534 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:53:40,980 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [55170#(and (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (not (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (not (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (= ~m~0 0))), 55174#(and (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod (+ ~s~0 1) 4294967296)) (= ~m~0 0) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (or (< 0 (mod ~t~0 4294967296)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= ~m~0 0)) (or (< 0 (mod ~t~0 4294967296)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (< 0 (mod (+ ~s~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296)))), 55172#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= ~m~0 0)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)))), 55176#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= ~m~0 0)) (or (< 0 (mod ~t~0 4294967296)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)))), 55168#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= ~m~0 0))), 55177#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (= ~m~0 0)), 55169#(and (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (= ~m~0 0)) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)))), 55166#(and (or (<= ~T~0 (+ ~t~0 1)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (or (<= (+ ~t~0 ~s~0) (+ ~T~0 ~S~0)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~T~0 (* (div ~T~0 4294967296) 4294967296))) (or (<= (+ ~s~0 (* (div ~T~0 4294967296) 4294967296) 1) (+ ~T~0 ~S~0)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (not (< 0 (mod ~t~0 4294967296)))) (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (+ ~s~0 (* (div ~T~0 4294967296) 4294967296)) (+ ~T~0 ~S~0))) (or (<= ~t~0 (+ 4294967295 (* (div ~T~0 4294967296) 4294967296))) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (or (= ~u~0 ~U~0) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (or (<= ~S~0 ~s~0) (< 0 (mod ~t~0 4294967296)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (< (* (div ~T~0 4294967296) 4294967296) ~T~0)) (or (<= ~S~0 (+ ~s~0 1)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (< (* (div ~T~0 4294967296) 4294967296) ~T~0)) (or (<= (+ ~t~0 ~s~0) (+ ~T~0 ~S~0)) (<= ~t~0 (+ ~T~0 1)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (+ ~T~0 ~S~0) (+ ~t~0 ~s~0))) (or (<= ~T~0 ~t~0) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (not (< 0 (mod ~t~0 4294967296)))) (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~m~0 0))), 55175#(and (or (< (div ~u~0 4294967296) (+ (div ~U~0 4294967296) 1)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (or (<= ~t~0 (+ (* (div ~T~0 4294967296) 4294967296) 4294967296)) (<= (+ (* (div (+ ~s~0 1) 4294967296) 4294967296) (* (div ~U~0 4294967296) 4294967296) (* (div ~u~0 4294967296) 4294967296) (* (div ~T~0 4294967296) 4294967296) (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 1)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (not (< 0 (mod ~t~0 4294967296))) (<= ~T~0 (* (div ~T~0 4294967296) 4294967296))) (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (not (< 0 (mod ~t~0 4294967296))) (<= (+ (div (+ ~s~0 1) 4294967296) (div ~u~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (< (* (div ~T~0 4294967296) 4294967296) ~T~0) (<= (* (div ~U~0 4294967296) 4294967296) (+ ~u~0 1))) (or (<= (+ ~U~0 ~T~0 ~S~0) (+ ~u~0 ~t~0 ~s~0)) (< (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div (+ ~s~0 1) 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296))) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (+ ~T~0 1) ~t~0) (<= ~T~0 (* (div ~T~0 4294967296) 4294967296))) (or (< 0 (mod ~t~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0) (+ ~u~0 ~t~0 ~s~0)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (< (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~U~0 4294967296) (div ~s~0 4294967296) (div ~T~0 4294967296))) (<= ~T~0 (* (div ~T~0 4294967296) 4294967296))) (or (< 0 (mod ~t~0 4294967296)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (+ (* (div ~U~0 4294967296) 4294967296) (* (div ~s~0 4294967296) 4294967296) (* (div ~u~0 4294967296) 4294967296) (* (div ~T~0 4294967296) 4294967296) (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 1)) (<= ~T~0 (* (div ~T~0 4294967296) 4294967296))) (or (< 0 (mod ~t~0 4294967296)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ ~U~0 ~S~0) (+ ~u~0 ~s~0)) (< (* (div ~T~0 4294967296) 4294967296) ~T~0)) (or (<= (+ ~U~0 ~S~0) (+ ~u~0 ~s~0 1)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (< (* (div ~T~0 4294967296) 4294967296) ~T~0)) (or (<= (+ (* (div (+ ~s~0 1) 4294967296) 4294967296) (* (div ~U~0 4294967296) 4294967296) (* (div ~u~0 4294967296) 4294967296) (* (div ~T~0 4294967296) 4294967296) (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~u~0 1)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (not (< 0 (mod ~t~0 4294967296))) (<= (+ ~T~0 1) ~t~0) (<= ~T~0 (* (div ~T~0 4294967296) 4294967296))) (or (< 0 (mod ~t~0 4294967296)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (+ (div ~s~0 4294967296) (div ~u~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (<= (* (div ~U~0 4294967296) 4294967296) (+ ~u~0 1))) (or (<= ~t~0 (+ (* (div ~T~0 4294967296) 4294967296) 4294967296)) (< (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div (+ ~s~0 1) 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296))) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~T~0 (* (div ~T~0 4294967296) 4294967296))) (or (< 0 (mod ~t~0 4294967296)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (< (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~U~0 4294967296) (div ~s~0 4294967296) (div ~T~0 4294967296))) (<= ~t~0 (+ 4294967294 (* (div ~T~0 4294967296) 4294967296))) (<= ~T~0 (* (div ~T~0 4294967296) 4294967296))) (or (< (div ~u~0 4294967296) (div ~U~0 4294967296)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (+ (div ~U~0 4294967296) (div ~s~0 4294967296) (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (< (* (div ~T~0 4294967296) 4294967296) ~T~0)) (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~m~0 0)) (or (<= (+ (div (+ ~s~0 1) 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (not (< 0 (mod ~t~0 4294967296))) (< (* (div ~T~0 4294967296) 4294967296) ~T~0) (not (<= (div ~U~0 4294967296) (div ~u~0 4294967296))))), 55167#(and (or (not (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (= ~m~0 0)) (or (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (not (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)))), 55171#(and (or (< 0 (mod ~t~0 4294967296)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= ~m~0 0)) (or (< 0 (mod ~t~0 4294967296)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)))), 55173#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (not (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (= ~m~0 0)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (not (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)))), 55178#(and (or (<= ~S~0 ~s~0) (< 0 (mod ~t~0 4294967296)) (not (< 0 (mod ~u~0 4294967296))) (< (* (div ~T~0 4294967296) 4294967296) ~T~0)) (or (<= ~T~0 (+ ~t~0 1)) (not (< 0 (mod ~u~0 4294967296)))) (or (not (< 0 (mod ~u~0 4294967296))) (= ~m~0 0)) (or (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (not (< 0 (mod ~u~0 4294967296))) (<= (+ ~T~0 ~S~0) (+ ~t~0 ~s~0))) (or (<= (+ ~t~0 ~s~0) (+ ~T~0 ~S~0)) (<= ~t~0 (+ ~T~0 1)) (not (< 0 (mod ~t~0 4294967296)))) (or (not (< 0 (mod ~t~0 4294967296))) (= ~m~0 0)) (or (<= ~t~0 (+ 4294967295 (* (div ~T~0 4294967296) 4294967296))) (not (< 0 (mod ~t~0 4294967296)))) (or (= ~u~0 ~U~0) (not (< 0 (mod ~t~0 4294967296)))) (or (<= (+ ~s~0 (* (div ~T~0 4294967296) 4294967296) 1) (+ ~T~0 ~S~0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (not (< 0 (mod ~t~0 4294967296)))) (or (<= ~T~0 ~t~0) (not (< 0 (mod ~t~0 4294967296)))) (or (<= (+ ~t~0 ~s~0) (+ ~T~0 ~S~0)) (not (< 0 (mod ~t~0 4294967296))) (<= ~T~0 (* (div ~T~0 4294967296) 4294967296))) (or (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (not (< 0 (mod ~t~0 4294967296))) (<= (+ ~T~0 ~S~0) (+ ~t~0 ~s~0))) (or (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (not (< 0 (mod ~u~0 4294967296))) (<= (+ ~s~0 (* (div ~T~0 4294967296) 4294967296)) (+ ~T~0 ~S~0))) (or (<= (+ ~t~0 ~s~0) (+ ~T~0 ~S~0)) (not (< 0 (mod ~u~0 4294967296))) (<= ~T~0 (* (div ~T~0 4294967296) 4294967296))) (or (<= ~t~0 (+ 4294967295 (* (div ~T~0 4294967296) 4294967296))) (not (< 0 (mod ~u~0 4294967296)))) (or (= ~u~0 ~U~0) (not (< 0 (mod ~u~0 4294967296)))) (or (<= ~S~0 (+ ~s~0 1)) (not (< 0 (mod ~t~0 4294967296))) (< (* (div ~T~0 4294967296) 4294967296) ~T~0)))] [2022-03-15 19:53:40,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 19:53:40,982 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:53:40,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 19:53:40,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=1536, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 19:53:40,982 INFO L87 Difference]: Start difference. First operand 1138 states and 4165 transitions. Second operand has 24 states, 23 states have (on average 3.739130434782609) internal successors, (86), 23 states have internal predecessors, (86), 0 states have call successors, (0), 0 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 19:54:02,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:54:02,378 INFO L93 Difference]: Finished difference Result 3003 states and 10609 transitions. [2022-03-15 19:54:02,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-03-15 19:54:02,379 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.739130434782609) internal successors, (86), 23 states have internal predecessors, (86), 0 states have call successors, (0), 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 19:54:02,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:54:02,386 INFO L225 Difference]: With dead ends: 3003 [2022-03-15 19:54:02,386 INFO L226 Difference]: Without dead ends: 2846 [2022-03-15 19:54:02,387 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 67 SyntacticMatches, 13 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4433 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=2240, Invalid=10642, Unknown=0, NotChecked=0, Total=12882 [2022-03-15 19:54:02,387 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 589 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 2037 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 2322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 2037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:54:02,388 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [589 Valid, 2 Invalid, 2322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 2037 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-03-15 19:54:02,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2846 states. [2022-03-15 19:54:02,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2846 to 1242. [2022-03-15 19:54:02,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1242 states, 1241 states have (on average 3.676873489121676) internal successors, (4563), 1241 states have internal predecessors, (4563), 0 states have call successors, (0), 0 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 19:54:02,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 4563 transitions. [2022-03-15 19:54:02,416 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 4563 transitions. Word has length 25 [2022-03-15 19:54:02,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:54:02,416 INFO L470 AbstractCegarLoop]: Abstraction has 1242 states and 4563 transitions. [2022-03-15 19:54:02,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.739130434782609) internal successors, (86), 23 states have internal predecessors, (86), 0 states have call successors, (0), 0 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 19:54:02,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 4563 transitions. [2022-03-15 19:54:02,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:54:02,418 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:54:02,419 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:54:02,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-03-15 19:54:02,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-15 19:54:02,635 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:54:02,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:54:02,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1739536574, now seen corresponding path program 3 times [2022-03-15 19:54:02,636 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:54:02,636 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831411512] [2022-03-15 19:54:02,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:54:02,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:54:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:54:03,505 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:54:03,505 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:54:03,505 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831411512] [2022-03-15 19:54:03,505 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831411512] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:54:03,505 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042832005] [2022-03-15 19:54:03,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:54:03,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:54:03,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:54:03,507 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:54:03,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 19:54:03,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:54:03,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:54:03,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-15 19:54:03,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:54:04,692 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:54:04,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:54:05,536 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:54:05,537 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042832005] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:54:05,537 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:54:05,537 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-03-15 19:54:05,537 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2019311252] [2022-03-15 19:54:05,537 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:54:05,539 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:54:05,548 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 163 transitions. [2022-03-15 19:54:05,548 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:54:14,170 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [60985#(and (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (= ~m~0 0)) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)))), 60997#(and (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= ~m~0 0))), 60993#(and (or (< 0 (mod ~t~0 4294967296)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= ~m~0 0)) (or (< 0 (mod ~t~0 4294967296)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)))), 60988#(and (or (<= (* (div ~S~0 4294967296) 4294967296) ~s~0) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ (* (div ~T~0 4294967296) 4294967296) 1) ~t~0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (not (< 0 (mod ~t~0 4294967296)))) (or (< 0 (mod ~t~0 4294967296)) (<= ~t~0 ~T~0) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (not (<= (+ (div ~S~0 4294967296) 1) (div ~s~0 4294967296))) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~s~0) (< 0 (mod ~t~0 4294967296)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (* (div ~T~0 4294967296) 4294967296) ~t~0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (* (div ~T~0 4294967296) 4294967296) ~t~0) (not (<= (+ (div ~S~0 4294967296) 1) (div ~s~0 4294967296))) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~s~0) (< 0 (mod ~t~0 4294967296)) (<= ~t~0 ~T~0) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (<= ~t~0 (+ ~T~0 1)) (<= (* (div ~S~0 4294967296) 4294967296) ~s~0) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~s~0) (< 0 (mod ~t~0 4294967296)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= ~T~0 (* (div ~T~0 4294967296) 4294967296))) (or (<= (+ ~t~0 ~s~0) (+ ~T~0 ~S~0)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (not (< 0 (mod ~t~0 4294967296))) (not (<= (+ (div ~S~0 4294967296) 1) (div (+ ~s~0 1) 4294967296))) (<= ~T~0 (* (div ~T~0 4294967296) 4294967296))) (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ (* (div ~T~0 4294967296) 4294967296) 1) ~t~0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (not (< 0 (mod ~t~0 4294967296))) (not (<= (+ (div ~S~0 4294967296) 1) (div (+ ~s~0 1) 4294967296)))) (or (<= ~t~0 (+ ~T~0 1)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (not (< 0 (mod ~t~0 4294967296))) (not (<= (+ (div ~S~0 4294967296) 1) (div (+ ~s~0 1) 4294967296)))) (or (<= (* (div ~S~0 4294967296) 4294967296) ~s~0) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= ~T~0 (* (div ~T~0 4294967296) 4294967296))) (or (<= (+ ~t~0 ~s~0) (+ ~T~0 ~S~0)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (not (<= (+ (div ~S~0 4294967296) 1) (div ~s~0 4294967296))) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= ~T~0 (* (div ~T~0 4294967296) 4294967296))) (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~m~0 0)) (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (= (+ (* (- 1) ~u~0) ~U~0) 0))), 60989#(and (or (not (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (= ~m~0 0)) (or (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (not (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)))), 60992#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= ~m~0 0))), 60991#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (not (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (= ~m~0 0)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (not (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)))), 60996#(and (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (div thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (= ~m~0 0)) (or (<= 1 thread3Thread1of1ForFork1_~cond~2) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)))), 60998#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= ~m~0 0)) (or (< 0 (mod ~t~0 4294967296)) (<= 1 thread3Thread1of1ForFork1_~cond~2) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (div thread3Thread1of1ForFork1_~cond~2 256) 0))), 60986#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= ~m~0 0)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)))), 60990#(and (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (not (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (not (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (= ~m~0 0))), 60987#(and (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (= ~m~0 0)) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)))), 60999#(and (or (< 0 (mod ~t~0 4294967296)) (<= 1 thread3Thread1of1ForFork1_~cond~2) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (div thread3Thread1of1ForFork1_~cond~2 256) 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (= ~m~0 0) (or (< 0 (mod ~t~0 4294967296)) (<= 1 thread3Thread1of1ForFork1_~cond~2) (<= 1 thread1Thread1of1ForFork2_~cond~0) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (< 0 (mod ~t~0 4294967296)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (div thread3Thread1of1ForFork1_~cond~2 256) 0))), 61000#(and (or (< 0 (mod ~t~0 4294967296)) (<= ~t~0 ~T~0) (not (<= (+ (div ~S~0 4294967296) 1) (div ~s~0 4294967296))) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (not (< 0 (mod ~u~0 4294967296)))) (or (<= (* (div ~T~0 4294967296) 4294967296) ~t~0) (not (<= (+ (div ~S~0 4294967296) 1) (div ~s~0 4294967296))) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (not (< 0 (mod ~u~0 4294967296)))) (or (<= ~t~0 (+ ~T~0 1)) (<= (* (div ~S~0 4294967296) 4294967296) ~s~0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (not (< 0 (mod ~t~0 4294967296)))) (or (<= (+ ~t~0 ~s~0) (+ ~T~0 ~S~0)) (not (<= (+ (div ~S~0 4294967296) 1) (div ~s~0 4294967296))) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (not (< 0 (mod ~u~0 4294967296))) (<= ~T~0 (* (div ~T~0 4294967296) 4294967296))) (or (<= (* (div ~S~0 4294967296) 4294967296) ~s~0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (not (< 0 (mod ~t~0 4294967296))) (<= ~T~0 (* (div ~T~0 4294967296) 4294967296))) (or (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~s~0) (< 0 (mod ~t~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (not (< 0 (mod ~u~0 4294967296))) (<= ~T~0 (* (div ~T~0 4294967296) 4294967296))) (or (<= (+ (* (div ~T~0 4294967296) 4294967296) 1) ~t~0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (not (< 0 (mod ~t~0 4294967296))) (not (<= (+ (div ~S~0 4294967296) 1) (div (+ ~s~0 1) 4294967296)))) (or (not (< 0 (mod ~u~0 4294967296))) (= ~m~0 0)) (or (<= (* (div ~S~0 4294967296) 4294967296) ~s~0) (<= (+ (* (div ~T~0 4294967296) 4294967296) 1) ~t~0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (not (< 0 (mod ~t~0 4294967296)))) (or (not (< 0 (mod ~t~0 4294967296))) (= ~m~0 0)) (or (not (< 0 (mod ~t~0 4294967296))) (= (+ (* (- 1) ~u~0) ~U~0) 0)) (or (<= (+ ~t~0 ~s~0) (+ ~T~0 ~S~0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (not (< 0 (mod ~t~0 4294967296))) (not (<= (+ (div ~S~0 4294967296) 1) (div (+ ~s~0 1) 4294967296))) (<= ~T~0 (* (div ~T~0 4294967296) 4294967296))) (or (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~s~0) (< 0 (mod ~t~0 4294967296)) (<= (* (div ~T~0 4294967296) 4294967296) ~t~0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (not (< 0 (mod ~u~0 4294967296)))) (or (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~s~0) (< 0 (mod ~t~0 4294967296)) (<= ~t~0 ~T~0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (not (< 0 (mod ~u~0 4294967296)))) (or (<= ~t~0 (+ ~T~0 1)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (not (< 0 (mod ~t~0 4294967296))) (not (<= (+ (div ~S~0 4294967296) 1) (div (+ ~s~0 1) 4294967296)))) (or (not (< 0 (mod ~u~0 4294967296))) (= (+ (* (- 1) ~u~0) ~U~0) 0))), 60995#(and (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (= ~m~0 0))), 60994#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (div thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (< 0 (mod ~t~0 4294967296)) (<= 1 thread3Thread1of1ForFork1_~cond~2) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (= ~m~0 0))] [2022-03-15 19:54:14,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 19:54:14,171 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:54:14,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 19:54:14,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=2155, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 19:54:14,171 INFO L87 Difference]: Start difference. First operand 1242 states and 4563 transitions. Second operand has 29 states, 28 states have (on average 3.5357142857142856) internal successors, (99), 28 states have internal predecessors, (99), 0 states have call successors, (0), 0 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 19:54:50,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:54:50,648 INFO L93 Difference]: Finished difference Result 3085 states and 10653 transitions. [2022-03-15 19:54:50,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2022-03-15 19:54:50,648 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.5357142857142856) internal successors, (99), 28 states have internal predecessors, (99), 0 states have call successors, (0), 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 19:54:50,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:54:50,655 INFO L225 Difference]: With dead ends: 3085 [2022-03-15 19:54:50,655 INFO L226 Difference]: Without dead ends: 2838 [2022-03-15 19:54:50,657 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 56 SyntacticMatches, 11 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12651 ImplicationChecksByTransitivity, 34.3s TimeCoverageRelationStatistics Valid=5328, Invalid=30962, Unknown=0, NotChecked=0, Total=36290 [2022-03-15 19:54:50,657 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 723 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 3139 mSolverCounterSat, 343 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 3482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 343 IncrementalHoareTripleChecker+Valid, 3139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:54:50,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [723 Valid, 4 Invalid, 3482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [343 Valid, 3139 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-03-15 19:54:50,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2838 states. [2022-03-15 19:54:50,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2838 to 1298. [2022-03-15 19:54:50,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1298 states, 1297 states have (on average 3.681572860447186) internal successors, (4775), 1297 states have internal predecessors, (4775), 0 states have call successors, (0), 0 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 19:54:50,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 4775 transitions. [2022-03-15 19:54:50,697 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 4775 transitions. Word has length 25 [2022-03-15 19:54:50,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:54:50,697 INFO L470 AbstractCegarLoop]: Abstraction has 1298 states and 4775 transitions. [2022-03-15 19:54:50,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.5357142857142856) internal successors, (99), 28 states have internal predecessors, (99), 0 states have call successors, (0), 0 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 19:54:50,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 4775 transitions. [2022-03-15 19:54:50,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:54:50,700 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:54:50,700 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:54:50,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 19:54:50,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:54:50,916 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:54:50,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:54:50,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1696472641, now seen corresponding path program 4 times [2022-03-15 19:54:50,917 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:54:50,917 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047144791] [2022-03-15 19:54:50,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:54:50,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:54:50,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:54:52,413 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:54:52,413 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:54:52,413 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047144791] [2022-03-15 19:54:52,413 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047144791] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:54:52,413 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136799267] [2022-03-15 19:54:52,413 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:54:52,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:54:52,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:54:52,414 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:54:52,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 19:54:52,561 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:54:52,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:54:52,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 19:54:52,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:54:53,738 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:54:53,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:54:55,754 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:54:55,755 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136799267] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:54:55,755 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:54:55,755 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 25 [2022-03-15 19:54:55,755 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [531388996] [2022-03-15 19:54:55,755 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:54:55,757 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:54:55,766 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 164 transitions. [2022-03-15 19:54:55,766 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:55:06,017 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [67133#(and (or (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (= ~m~0 0)) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div ~U~0 4294967296) 4294967296) (* (div ~S~0 4294967296) 4294967296) (* (div ~T~0 4294967296) 4294967296) 8589934591)))), 67142#(and (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (= ~m~0 0) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div ~U~0 4294967296) 4294967296) (* (div ~S~0 4294967296) 4294967296) (* (div ~T~0 4294967296) 4294967296) 8589934591))), 67143#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div ~U~0 4294967296) 4294967296) (* (div ~S~0 4294967296) 4294967296) (* (div ~T~0 4294967296) 4294967296) 8589934591))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= ~m~0 0)) (or (< 0 (mod ~t~0 4294967296)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (< 0 (mod ~t~0 4294967296)) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (< 0 (mod ~u~0 4294967296)))), 67141#(and (or (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (* (div ~U~0 4294967296) 4294967296) (+ ~u~0 1))) (or (<= (+ ~U~0 ~T~0 ~S~0) (+ ~u~0 ~t~0 ~s~0)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967295)) (<= ~U~0 (* (div ~U~0 4294967296) 4294967296)) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) 2 (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (<= (+ ~U~0 ~T~0 ~S~0) (+ ~u~0 ~t~0 ~s~0)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (not (< 0 (mod ~t~0 4294967296))) (<= ~U~0 (* (div ~U~0 4294967296) 4294967296)) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967294)) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) 2 (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~s~0) (< 0 (mod ~t~0 4294967296)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~U~0 (* (div ~U~0 4294967296) 4294967296)) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) 2 (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (<= (+ (div ~t~0 4294967296) (div ~U~0 4294967296) (div ~s~0 4294967296) (div ~m~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (<= (+ (div (+ ~s~0 1) 4294967296) (div ~U~0 4294967296) (div (+ (- 1) ~t~0) 4294967296) (div ~m~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (<= (* (div ~S~0 4294967296) 4294967296) ~s~0) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~U~0 (* (div ~U~0 4294967296) 4294967296)) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) 2 (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (<= (* (div ~S~0 4294967296) 4294967296) ~s~0) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))) (or (< (div ~u~0 4294967296) (div ~U~0 4294967296)) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967295)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))) (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~U~0 (* (div ~U~0 4294967296) 4294967296)) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (<= (+ 2 (* (div ~S~0 4294967296) 4294967296)) ~s~0)) (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~U~0 (* (div ~U~0 4294967296) 4294967296)) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) 2 (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (<= (+ (div ~U~0 4294967296) (div ~s~0 4294967296) (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (<= (+ (div (+ ~s~0 1) 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (not (< 0 (mod ~t~0 4294967296))) (<= ~U~0 (* (div ~U~0 4294967296) 4294967296)) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) 2 (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~s~0) (< 0 (mod ~t~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0) (+ ~u~0 ~t~0 ~s~0)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= ~U~0 (* (div ~U~0 4294967296) 4294967296)) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) 2 (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (< 0 (mod ~t~0 4294967296)) (<= (+ ~t~0 ~U~0) (+ 4294967295 ~u~0 (* (div ~T~0 4294967296) 4294967296))) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967295)) (<= ~U~0 (* (div ~U~0 4294967296) 4294967296)) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) 2 (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (<= (+ (div ~t~0 4294967296) (div ~U~0 4294967296) (div ~s~0 4294967296) (div ~m~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (not (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) 2 (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (< (div ~u~0 4294967296) (+ (div ~U~0 4294967296) 1)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (or (< 0 (mod ~t~0 4294967296)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~U~0 (* (div ~U~0 4294967296) 4294967296)) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (<= (+ (* (div ~S~0 4294967296) 4294967296) 3) ~s~0)) (or (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div ~S~0 4294967296) 4294967296) ~u~0 (* (div ~T~0 4294967296) 4294967296) 8589934591)) (not (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) 2 (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (or (<= (+ ~U~0 ~T~0 ~S~0) (+ ~u~0 ~t~0 ~s~0)) (<= (* (div ~S~0 4294967296) 4294967296) ~s~0) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= ~U~0 (* (div ~U~0 4294967296) 4294967296)) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) 2 (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (<= (mod ~t~0 4294967296) 0) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967294)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))) (or (<= (+ (div (+ ~s~0 1) 4294967296) (div ~U~0 4294967296) (div (+ (- 1) ~t~0) 4294967296) (div ~m~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (not (< 0 (mod ~t~0 4294967296))) (<= ~U~0 (* (div ~U~0 4294967296) 4294967296)) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967294)) (<= (+ ~t~0 ~U~0) (+ ~u~0 (* (div ~T~0 4294967296) 4294967296) 4294967296)) (<= (+ (div ~S~0 4294967296) (div ~U~0 4294967296) 2 (div ~T~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~m~0 0)) (or (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~s~0) (< 0 (mod ~t~0 4294967296)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)))), 67138#(and (or (< 0 (mod ~t~0 4294967296)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div ~U~0 4294967296) 4294967296) (* (div ~S~0 4294967296) 4294967296) (* (div ~T~0 4294967296) 4294967296) 8589934591))) (or (< 0 (mod ~t~0 4294967296)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= ~m~0 0)) (or (< 0 (mod ~t~0 4294967296)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (< 0 (mod ~t~0 4294967296)) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), 67136#(and (or (< 0 (mod ~t~0 4294967296)) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div ~U~0 4294967296) 4294967296) (* (div ~S~0 4294967296) 4294967296) (* (div ~T~0 4294967296) 4294967296) 8589934591))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= ~m~0 0))), 67137#(and (or (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (not (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (not (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div ~U~0 4294967296) 4294967296) (* (div ~S~0 4294967296) 4294967296) (* (div ~T~0 4294967296) 4294967296) 8589934591))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (not (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (not (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (= ~m~0 0))), 67139#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (not (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div ~U~0 4294967296) 4294967296) (* (div ~S~0 4294967296) 4294967296) (* (div ~T~0 4294967296) 4294967296) 8589934591))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (not (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (= ~m~0 0)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (not (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0))) (or (< 0 (mod ~t~0 4294967296)) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (< 0 (mod ~u~0 4294967296)) (not (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)))), 67135#(and (or (not (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (= ~m~0 0)) (or (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (not (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0))) (or (not (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div ~U~0 4294967296) 4294967296) (* (div ~S~0 4294967296) 4294967296) (* (div ~T~0 4294967296) 4294967296) 8589934591))) (or (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (not (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)))), 67134#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div ~U~0 4294967296) 4294967296) (* (div ~S~0 4294967296) 4294967296) (* (div ~T~0 4294967296) 4294967296) 8589934591))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= ~m~0 0)) (or (< 0 (mod ~t~0 4294967296)) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (< 0 (mod ~u~0 4294967296))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)))), 67140#(and (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod (+ ~s~0 1) 4294967296)) (= ~m~0 0) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (or (< 0 (mod ~t~0 4294967296)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= ~m~0 0)) (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod (+ ~s~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div ~U~0 4294967296) 4294967296) (* (div ~S~0 4294967296) 4294967296) (* (div ~T~0 4294967296) 4294967296) 8589934591))) (or (< 0 (mod ~t~0 4294967296)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div ~U~0 4294967296) 4294967296) (* (div ~S~0 4294967296) 4294967296) (* (div ~T~0 4294967296) 4294967296) 8589934591))) (or (< 0 (mod ~t~0 4294967296)) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))) (or (< 0 (mod ~t~0 4294967296)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod (+ ~s~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (< 0 (mod (+ ~s~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))))] [2022-03-15 19:55:06,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:55:06,017 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:55:06,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:55:06,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=1162, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:55:06,018 INFO L87 Difference]: Start difference. First operand 1298 states and 4775 transitions. Second operand has 22 states, 21 states have (on average 3.7142857142857144) internal successors, (78), 21 states have internal predecessors, (78), 0 states have call successors, (0), 0 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 19:55:35,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:55:35,632 INFO L93 Difference]: Finished difference Result 2685 states and 9385 transitions. [2022-03-15 19:55:35,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-03-15 19:55:35,632 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.7142857142857144) internal successors, (78), 21 states have internal predecessors, (78), 0 states have call successors, (0), 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 19:55:35,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:55:35,637 INFO L225 Difference]: With dead ends: 2685 [2022-03-15 19:55:35,638 INFO L226 Difference]: Without dead ends: 2532 [2022-03-15 19:55:35,638 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 63 SyntacticMatches, 15 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3321 ImplicationChecksByTransitivity, 28.3s TimeCoverageRelationStatistics Valid=1595, Invalid=9117, Unknown=0, NotChecked=0, Total=10712 [2022-03-15 19:55:35,639 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 439 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 2767 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 2980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 2767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:55:35,639 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [439 Valid, 4 Invalid, 2980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 2767 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-03-15 19:55:35,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2532 states. [2022-03-15 19:55:35,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2532 to 1336. [2022-03-15 19:55:35,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1336 states, 1335 states have (on average 3.695880149812734) internal successors, (4934), 1335 states have internal predecessors, (4934), 0 states have call successors, (0), 0 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 19:55:35,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 4934 transitions. [2022-03-15 19:55:35,665 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 4934 transitions. Word has length 25 [2022-03-15 19:55:35,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:55:35,666 INFO L470 AbstractCegarLoop]: Abstraction has 1336 states and 4934 transitions. [2022-03-15 19:55:35,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.7142857142857144) internal successors, (78), 21 states have internal predecessors, (78), 0 states have call successors, (0), 0 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 19:55:35,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 4934 transitions. [2022-03-15 19:55:35,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:55:35,668 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:55:35,668 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:55:35,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-15 19:55:35,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-15 19:55:35,885 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:55:35,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:55:35,885 INFO L85 PathProgramCache]: Analyzing trace with hash 372723137, now seen corresponding path program 5 times [2022-03-15 19:55:35,887 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:55:35,887 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984740836] [2022-03-15 19:55:35,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:55:35,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:55:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:55:36,829 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:55:36,829 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:55:36,829 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984740836] [2022-03-15 19:55:36,829 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984740836] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:55:36,829 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010781562] [2022-03-15 19:55:36,829 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:55:36,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:55:36,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:55:36,830 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:55:36,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-15 19:55:37,000 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:55:37,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:55:37,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 36 conjunts are in the unsatisfiable core [2022-03-15 19:55:37,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:55:38,215 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:55:38,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:55:39,599 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:55:39,599 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010781562] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:55:39,599 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:55:39,599 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-03-15 19:55:39,599 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [352907164] [2022-03-15 19:55:39,599 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:55:39,601 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:55:39,612 INFO L252 McrAutomatonBuilder]: Finished intersection with 86 states and 174 transitions. [2022-03-15 19:55:39,612 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:55:45,499 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [72810#(and (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (= ~m~0 0)) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)))), 72811#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= ~m~0 0)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)))), 72813#(and (or (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (< (* (div ~T~0 4294967296) 4294967296) ~T~0)) (or (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (<= ~t~0 (+ 4294967294 (* (div (+ (- 1) (* (- 1) ~S~0) (* (- 1) ~U~0) ~u~0 ~t~0 ~s~0 (* (div ~T~0 4294967296) 4294967296) (* (- 1) ~T~0)) 4294967296) 4294967296))) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= ~U~0 (* (div ~U~0 4294967296) 4294967296))) (or (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (<= (div (+ (- 1) ~u~0) 4294967296) (div ~U~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (<= ~s~0 (+ ~S~0 1)) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= ~U~0 (* (div ~U~0 4294967296) 4294967296))) (or (<= (* (div ~U~0 4294967296) 4294967296) ~u~0) (not (<= ~U~0 (* (div ~U~0 4294967296) 4294967296))) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (= ~m~0 0) (or (not (<= (div ~U~0 4294967296) (div (+ (- 1) ~u~0) 4294967296))) (not (<= ~U~0 (* (div ~U~0 4294967296) 4294967296))) (<= ~t~0 (* (div ~t~0 4294967296) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)))), 72812#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= ~m~0 0)) (or (< 0 (mod ~t~0 4294967296)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)))), 72809#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (= ~m~0 0))] [2022-03-15 19:55:45,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:55:45,501 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:55:45,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:55:45,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1086, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 19:55:45,502 INFO L87 Difference]: Start difference. First operand 1336 states and 4934 transitions. Second operand has 17 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 0 states have call successors, (0), 0 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 19:55:56,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:55:56,979 INFO L93 Difference]: Finished difference Result 1976 states and 7149 transitions. [2022-03-15 19:55:56,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-03-15 19:55:56,979 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 0 states have call successors, (0), 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 19:55:56,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:55:56,983 INFO L225 Difference]: With dead ends: 1976 [2022-03-15 19:55:56,983 INFO L226 Difference]: Without dead ends: 1866 [2022-03-15 19:55:56,984 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 56 SyntacticMatches, 27 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2784 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=1386, Invalid=6446, Unknown=0, NotChecked=0, Total=7832 [2022-03-15 19:55:56,984 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 276 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 1670 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 1799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:55:56,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 5 Invalid, 1799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1670 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-03-15 19:55:56,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2022-03-15 19:55:57,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1328. [2022-03-15 19:55:57,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1327 states have (on average 3.6940467219291637) internal successors, (4902), 1327 states have internal predecessors, (4902), 0 states have call successors, (0), 0 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 19:55:57,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 4902 transitions. [2022-03-15 19:55:57,024 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 4902 transitions. Word has length 25 [2022-03-15 19:55:57,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:55:57,024 INFO L470 AbstractCegarLoop]: Abstraction has 1328 states and 4902 transitions. [2022-03-15 19:55:57,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 0 states have call successors, (0), 0 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 19:55:57,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 4902 transitions. [2022-03-15 19:55:57,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:55:57,026 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:55:57,026 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:55:57,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-15 19:55:57,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:55:57,227 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:55:57,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:55:57,228 INFO L85 PathProgramCache]: Analyzing trace with hash -2106642092, now seen corresponding path program 6 times [2022-03-15 19:55:57,229 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:55:57,229 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511348140] [2022-03-15 19:55:57,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:55:57,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:55:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:55:58,537 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:55:58,538 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:55:58,538 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511348140] [2022-03-15 19:55:58,538 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511348140] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:55:58,538 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606299658] [2022-03-15 19:55:58,538 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:55:58,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:55:58,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:55:58,539 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:55:58,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-15 19:55:58,710 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:55:58,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:55:58,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 19:55:58,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:55:59,757 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:55:59,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:56:01,260 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:56:01,260 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606299658] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:56:01,260 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:56:01,260 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 27 [2022-03-15 19:56:01,260 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1094244742] [2022-03-15 19:56:01,260 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:56:01,262 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:56:01,271 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 164 transitions. [2022-03-15 19:56:01,271 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:56:08,310 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [77730#(and (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (not (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (not (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (= ~m~0 0))), 77736#(and (or (<= 1 thread3Thread1of1ForFork1_~cond~2) (<= 1 thread1Thread1of1ForFork2_~cond~0) (= ~m~0 0)) (or (<= (div thread3Thread1of1ForFork1_~cond~2 256) 0) (= ~m~0 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 (mod ~t~0 4294967296)) (<= 1 thread3Thread1of1ForFork1_~cond~2) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (div thread3Thread1of1ForFork1_~cond~2 256) 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread3Thread1of1ForFork1_~cond~2 256) 0) (= ~m~0 0)) (or (< 0 (mod ~t~0 4294967296)) (<= 1 thread3Thread1of1ForFork1_~cond~2) (<= 1 thread1Thread1of1ForFork2_~cond~0) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (< 0 (mod ~t~0 4294967296)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (div thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (<= 1 thread3Thread1of1ForFork1_~cond~2) (= ~m~0 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))), 77732#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= ~m~0 0)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)))), 77726#(and (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (div thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (div thread3Thread1of1ForFork1_~cond~2 256) 0) (= ~m~0 0)) (or (<= 1 thread3Thread1of1ForFork1_~cond~2) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (= ~m~0 0)) (or (<= 1 thread3Thread1of1ForFork1_~cond~2) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)))), 77737#(and (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod (+ ~s~0 1) 4294967296)) (= ~m~0 0) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (or (< 0 (mod ~t~0 4294967296)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= ~m~0 0)) (or (< 0 (mod ~t~0 4294967296)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (< 0 (mod (+ ~s~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296)))), 77727#(and (or (not (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (= ~m~0 0)) (or (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (not (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)))), 77723#(and (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (= ~m~0 0)) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)))), 77724#(and (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (= ~m~0 0)) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)))), 77735#(and (or (< 0 (mod ~t~0 4294967296)) (<= 1 thread3Thread1of1ForFork1_~cond~2) (< 0 (mod ~u~0 4294967296)) (= ~m~0 0)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (div thread3Thread1of1ForFork1_~cond~2 256) 0) (= ~m~0 0)) (or (< 0 (mod ~t~0 4294967296)) (<= 1 thread3Thread1of1ForFork1_~cond~2) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (div thread3Thread1of1ForFork1_~cond~2 256) 0))), 77734#(and (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= ~m~0 0))), 77729#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (div thread3Thread1of1ForFork1_~cond~2 256) 0)) (or (< 0 (mod ~t~0 4294967296)) (<= 1 thread3Thread1of1ForFork1_~cond~2) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (< 0 (mod ~t~0 4294967296)) (<= 1 thread3Thread1of1ForFork1_~cond~2) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= ~m~0 0)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= (div thread3Thread1of1ForFork1_~cond~2 256) 0) (= ~m~0 0))), 77733#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (not (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (= ~m~0 0)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (not (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)))), 77731#(and (or (< 0 (mod ~t~0 4294967296)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= ~m~0 0)) (or (< 0 (mod ~t~0 4294967296)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)))), 77738#(and (or (<= ~S~0 ~s~0) (< 0 (mod ~t~0 4294967296)) (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (<= ~S~0 (+ ~s~0 1)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (+ 2 (* (div ~T~0 4294967296) 4294967296)) ~t~0) (not (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)))) (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~m~0 0) (not (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)))) (or (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)) (= (+ (* (- 1) thread3Thread1of1ForFork1_~cond~2) 1) 0) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (or (= (* (- 1) thread3Thread1of1ForFork1_~cond~2) 0) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (not (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)))) (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (not (< 0 (mod ~t~0 4294967296))) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967294)) (<= (+ 2 (* (div ~T~0 4294967296) 4294967296)) ~t~0) (not (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div (+ (- 1) ~t~0) 4294967296))) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (not (< 0 (mod ~t~0 4294967296))) (not (<= (+ (div ~S~0 4294967296) 1) (div (+ ~s~0 1) 4294967296))) (not (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)))) (or (<= ~S~0 ~s~0) (not (<= (+ (div ~T~0 4294967296) 1) (div (+ (- 1) ~t~0) 4294967296))) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (< (* (div ~S~0 4294967296) 4294967296) ~S~0) (not (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)))) (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (< (* (div ~S~0 4294967296) 4294967296) ~S~0) (<= (+ 2 (* (div ~T~0 4294967296) 4294967296)) ~t~0) (not (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)))) (or (< 0 (mod ~t~0 4294967296)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967295)) (not (<= ~u~0 (* (div ~u~0 4294967296) 4294967296)))) (or (<= ~S~0 (+ ~s~0 1)) (< (* (div ~u~0 4294967296) 4294967296) ~u~0) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (< (div (+ (- 1) ~t~0) 4294967296) (+ (div ~T~0 4294967296) 1))) (or (< 0 (mod ~t~0 4294967296)) (<= (+ ~S~0 1) ~s~0) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (< (* (div ~S~0 4294967296) 4294967296) ~S~0) (not (<= ~u~0 (* (div ~u~0 4294967296) 4294967296))))), 77725#(and (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (= ~m~0 0))), 77728#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= ~m~0 0)))] [2022-03-15 19:56:08,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 19:56:08,311 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:56:08,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 19:56:08,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=1685, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 19:56:08,311 INFO L87 Difference]: Start difference. First operand 1328 states and 4902 transitions. Second operand has 29 states, 28 states have (on average 3.4642857142857144) internal successors, (97), 28 states have internal predecessors, (97), 0 states have call successors, (0), 0 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 19:56:44,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:56:44,720 INFO L93 Difference]: Finished difference Result 2790 states and 9754 transitions. [2022-03-15 19:56:44,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2022-03-15 19:56:44,721 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.4642857142857144) internal successors, (97), 28 states have internal predecessors, (97), 0 states have call successors, (0), 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 19:56:44,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:56:44,726 INFO L225 Difference]: With dead ends: 2790 [2022-03-15 19:56:44,726 INFO L226 Difference]: Without dead ends: 2580 [2022-03-15 19:56:44,727 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 63 SyntacticMatches, 9 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8231 ImplicationChecksByTransitivity, 33.7s TimeCoverageRelationStatistics Valid=3768, Invalid=21672, Unknown=0, NotChecked=0, Total=25440 [2022-03-15 19:56:44,728 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 587 mSDsluCounter, 1206 mSDsCounter, 0 mSdLazyCounter, 4145 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 4475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 4145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:56:44,728 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [587 Valid, 11 Invalid, 4475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 4145 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-03-15 19:56:44,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2580 states. [2022-03-15 19:56:44,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2580 to 1344. [2022-03-15 19:56:44,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1344 states, 1343 states have (on average 3.697691734921817) internal successors, (4966), 1343 states have internal predecessors, (4966), 0 states have call successors, (0), 0 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 19:56:44,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 4966 transitions. [2022-03-15 19:56:44,763 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 4966 transitions. Word has length 25 [2022-03-15 19:56:44,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:56:44,763 INFO L470 AbstractCegarLoop]: Abstraction has 1344 states and 4966 transitions. [2022-03-15 19:56:44,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.4642857142857144) internal successors, (97), 28 states have internal predecessors, (97), 0 states have call successors, (0), 0 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 19:56:44,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 4966 transitions. [2022-03-15 19:56:44,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:56:44,766 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:56:44,766 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:56:44,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-15 19:56:44,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:56:44,982 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:56:44,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:56:44,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1057655100, now seen corresponding path program 7 times [2022-03-15 19:56:44,983 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:56:44,984 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147518103] [2022-03-15 19:56:44,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:56:44,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:56:45,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:56:45,664 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:56:45,664 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:56:45,664 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147518103] [2022-03-15 19:56:45,665 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147518103] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:56:45,665 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858104940] [2022-03-15 19:56:45,665 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:56:45,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:56:45,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:56:45,666 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:56:45,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-15 19:56:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:56:45,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 42 conjunts are in the unsatisfiable core [2022-03-15 19:56:45,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:56:46,864 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:56:46,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:56:47,989 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:56:47,989 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858104940] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:56:47,989 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:56:47,989 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-03-15 19:56:47,990 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [81668535] [2022-03-15 19:56:47,990 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:56:47,992 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:56:48,000 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 155 transitions. [2022-03-15 19:56:48,000 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:56:52,007 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [83629#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (= ~m~0 0))), 83628#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= ~m~0 0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 (mod ~t~0 4294967296)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (< 0 (mod ~u~0 4294967296)) (= ~m~0 0)) (or (< 0 (mod ~t~0 4294967296)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)))), 83626#(and (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (= ~m~0 0)) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)))), 83627#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= ~m~0 0)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))))] [2022-03-15 19:56:52,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:56:52,008 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:56:52,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:56:52,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=1214, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 19:56:52,008 INFO L87 Difference]: Start difference. First operand 1344 states and 4966 transitions. Second operand has 17 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 0 states have call successors, (0), 0 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 19:56:58,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:56:58,597 INFO L93 Difference]: Finished difference Result 2132 states and 7697 transitions. [2022-03-15 19:56:58,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-03-15 19:56:58,598 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 0 states have call successors, (0), 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 19:56:58,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:56:58,602 INFO L225 Difference]: With dead ends: 2132 [2022-03-15 19:56:58,602 INFO L226 Difference]: Without dead ends: 2018 [2022-03-15 19:56:58,602 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 55 SyntacticMatches, 19 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2590 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=1123, Invalid=6533, Unknown=0, NotChecked=0, Total=7656 [2022-03-15 19:56:58,604 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 325 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 1490 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 1598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:56:58,604 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [325 Valid, 5 Invalid, 1598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1490 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 19:56:58,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2018 states. [2022-03-15 19:56:58,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2018 to 1344. [2022-03-15 19:56:58,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1344 states, 1343 states have (on average 3.697691734921817) internal successors, (4966), 1343 states have internal predecessors, (4966), 0 states have call successors, (0), 0 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 19:56:58,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 4966 transitions. [2022-03-15 19:56:58,626 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 4966 transitions. Word has length 25 [2022-03-15 19:56:58,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:56:58,627 INFO L470 AbstractCegarLoop]: Abstraction has 1344 states and 4966 transitions. [2022-03-15 19:56:58,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 0 states have call successors, (0), 0 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 19:56:58,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 4966 transitions. [2022-03-15 19:56:58,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:56:58,629 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:56:58,629 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:56:58,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-15 19:56:58,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:56:58,856 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:56:58,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:56:58,856 INFO L85 PathProgramCache]: Analyzing trace with hash 463371727, now seen corresponding path program 4 times [2022-03-15 19:56:58,857 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:56:58,857 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648312692] [2022-03-15 19:56:58,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:56:58,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:56:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:56:59,131 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:56:59,132 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:56:59,132 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648312692] [2022-03-15 19:56:59,132 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648312692] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:56:59,132 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124829326] [2022-03-15 19:56:59,132 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:56:59,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:56:59,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:56:59,133 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:56:59,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-15 19:56:59,204 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:56:59,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:56:59,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:56:59,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:56:59,447 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:56:59,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:56:59,574 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:56:59,574 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124829326] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:56:59,574 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:56:59,574 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 6] total 17 [2022-03-15 19:56:59,574 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1357927142] [2022-03-15 19:56:59,574 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:56:59,577 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:56:59,594 INFO L252 McrAutomatonBuilder]: Finished intersection with 124 states and 266 transitions. [2022-03-15 19:56:59,594 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:57:01,903 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [88722#(and (or (<= ~t~0 (+ 2 ~T~0)) (< (* (div ~T~0 4294967296) 4294967296) ~T~0)) (<= ~t~0 (+ 4294967295 (* (div ~T~0 4294967296) 4294967296))) (<= (* (div ~T~0 4294967296) 4294967296) ~t~0)), 88721#(and (or (<= ~t~0 (+ ~T~0 1)) (< (* (div ~T~0 4294967296) 4294967296) ~T~0)) (<= ~t~0 (+ 4294967295 (* (div ~T~0 4294967296) 4294967296))) (<= (* (div ~T~0 4294967296) 4294967296) ~t~0)), 88723#(and (or (<= (+ (* (div ~T~0 4294967296) 4294967296) 1) ~t~0) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0)))] [2022-03-15 19:57:01,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:57:01,904 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:57:01,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:57:01,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2022-03-15 19:57:01,904 INFO L87 Difference]: Start difference. First operand 1344 states and 4966 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 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 19:57:02,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:57:02,364 INFO L93 Difference]: Finished difference Result 2660 states and 9525 transitions. [2022-03-15 19:57:02,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 19:57:02,365 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 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 19:57:02,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:57:02,370 INFO L225 Difference]: With dead ends: 2660 [2022-03-15 19:57:02,370 INFO L226 Difference]: Without dead ends: 2636 [2022-03-15 19:57:02,370 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 120 SyntacticMatches, 19 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2022-03-15 19:57:02,371 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 177 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:57:02,371 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 16 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:57:02,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2022-03-15 19:57:02,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 1244. [2022-03-15 19:57:02,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1244 states, 1243 states have (on average 3.7135961383748994) internal successors, (4616), 1243 states have internal predecessors, (4616), 0 states have call successors, (0), 0 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 19:57:02,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 4616 transitions. [2022-03-15 19:57:02,398 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 4616 transitions. Word has length 27 [2022-03-15 19:57:02,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:57:02,398 INFO L470 AbstractCegarLoop]: Abstraction has 1244 states and 4616 transitions. [2022-03-15 19:57:02,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 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 19:57:02,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 4616 transitions. [2022-03-15 19:57:02,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:57:02,400 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:57:02,400 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:57:02,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-15 19:57:02,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:57:02,620 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:57:02,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:57:02,620 INFO L85 PathProgramCache]: Analyzing trace with hash 2142475243, now seen corresponding path program 5 times [2022-03-15 19:57:02,621 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:57:02,621 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486402154] [2022-03-15 19:57:02,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:57:02,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:57:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:57:03,668 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:57:03,668 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:57:03,668 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486402154] [2022-03-15 19:57:03,668 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486402154] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:57:03,668 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060312502] [2022-03-15 19:57:03,668 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:57:03,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:57:03,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:57:03,670 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:57:03,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-15 19:57:03,934 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:57:03,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:57:03,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-15 19:57:03,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:57:04,901 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:57:04,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:57:10,613 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:57:10,614 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060312502] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:57:10,614 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:57:10,614 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 32 [2022-03-15 19:57:10,614 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2065368726] [2022-03-15 19:57:10,614 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:57:10,617 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:57:10,632 INFO L252 McrAutomatonBuilder]: Finished intersection with 118 states and 253 transitions. [2022-03-15 19:57:10,632 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:57:29,090 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [94078#(and (or (<= 0 ~m~0) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)))), 94082#(and (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967296))) (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (* (div ~T~0 4294967296) 4294967296) ~t~0)) (or (<= ~t~0 (+ 4294967295 (* (div ~T~0 4294967296) 4294967296))) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (or (= ~u~0 ~U~0) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (or (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~s~0) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967295)) (not (< 0 (mod ~t~0 4294967296)))) (or (< 0 (mod ~t~0 4294967296)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ 2 (* (div ~S~0 4294967296) 4294967296)) ~s~0)) (or (< 0 (mod ~t~0 4294967296)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ ~T~0 ~S~0) (+ ~t~0 ~s~0))) (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ (* (div ~t~0 4294967296) 4294967296) ~s~0) (+ ~T~0 ~S~0))) (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ ~s~0 (* (div (+ (- 1) ~t~0) 4294967296) 4294967296) 1) (+ ~T~0 ~S~0))) (or (not (<= ~t~0 (+ (* (div (+ (- 1) ~t~0) 4294967296) 4294967296) 1))) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ ~T~0 ~S~0) (+ ~t~0 ~s~0))) (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~m~0 0))), 94086#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (div ~U~0 4294967296) (div ~u~0 4294967296))) (or (< 0 (mod ~t~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div ~S~0 4294967296) 4294967296) (* (div ~u~0 4294967296) 4294967296) 4294967297 (* (div ~T~0 4294967296) 4294967296))) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (< 0 (mod ~t~0 4294967296)) (< (div ~u~0 4294967296) (+ (div ~U~0 4294967296) 1)) (< 0 (mod ~u~0 4294967296))) (or (<= (+ (* (div (+ (* (div ~u~0 4294967296) (- 4294967296)) (* (- 1) ~s~0) 4294967295 ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~s~0 (* (div ~u~0 4294967296) 4294967296)) (+ ~U~0 ~T~0 ~S~0)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (< 0 (mod ~t~0 4294967296)) (not (<= ~U~0 (* (div ~U~0 4294967296) 4294967296))) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (+ (* (div ~S~0 4294967296) 4294967296) 3) ~s~0)) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= ~m~0 0)) (or (< 0 (mod ~t~0 4294967296)) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (+ ~s~0 (* (div ~T~0 4294967296) 4294967296)) (+ ~T~0 ~S~0 1)))), 94085#(and (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (= ~m~0 0)) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967296)) (<= (+ ~s~0 (* (div ~T~0 4294967296) 4294967296)) (+ ~T~0 ~S~0 1))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (div ~u~0 4294967296) (+ (div ~U~0 4294967296) 1))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (div ~U~0 4294967296) (div ~u~0 4294967296))) (or (<= (+ (* (div (+ (* (div ~u~0 4294967296) (- 4294967296)) (* (- 1) ~s~0) 4294967295 ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~s~0 (* (div ~u~0 4294967296) 4294967296)) (+ ~U~0 ~T~0 ~S~0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* (div ~S~0 4294967296) 4294967296) 3) ~s~0)) (or (not (<= ~U~0 (* (div ~U~0 4294967296) 4294967296))) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967296))) (or (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div ~S~0 4294967296) 4294967296) (* (div ~u~0 4294967296) 4294967296) 4294967297 (* (div ~T~0 4294967296) 4294967296))) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967296)))), 94079#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 (mod ~t~0 4294967296)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (< 0 (mod ~u~0 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (<= 0 ~m~0) (< 0 (mod ~t~0 4294967296)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (< 0 (mod ~u~0 4294967296))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 (mod ~t~0 4294967296)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (<= 0 ~m~0) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))), 94077#(and (or (<= 1 thread1Thread1of1ForFork2_~cond~0) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (<= 0 ~m~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= 0 ~m~0) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= 1 thread1Thread1of1ForFork2_~cond~0) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)))), 94084#(and (or (<= 0 ~m~0) (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967295))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (div ~U~0 4294967296) (div (+ (- 1) ~u~0) 4294967296))) (or (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~s~0) (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967295)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967295))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (< (div (+ (- 1) ~u~0) 4294967296) (+ (div ~U~0 4294967296) 1))) (or (<= 0 ~m~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~s~0) (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296))) (or (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~s~0) (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)))), 94088#(and (or (<= (+ 2 (* (div (+ (- 1) ~t~0) 4294967296) 4294967296)) ~t~0) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967295)) (<= (+ ~s~0 (* (div ~T~0 4294967296) 4294967296)) (+ ~T~0 ~S~0)) (not (<= (div ~U~0 4294967296) (div ~u~0 4294967296)))) (or (< (div ~u~0 4294967296) (+ (div ~U~0 4294967296) 1)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ 2 (* (div ~S~0 4294967296) 4294967296)) ~s~0) (not (<= (div ~U~0 4294967296) (div ~u~0 4294967296)))) (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (* (div ~U~0 4294967296) 4294967296) (+ ~u~0 1))) (or (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div ~S~0 4294967296) 4294967296) ~u~0 (* (div ~T~0 4294967296) 4294967296) 8589934591)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967295)) (not (< 0 (mod ~t~0 4294967296))) (not (<= (div ~U~0 4294967296) (div ~u~0 4294967296)))) (or (< 0 (mod ~t~0 4294967296)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 3) ~s~0) (not (<= (div ~U~0 4294967296) (div ~u~0 4294967296)))) (or (< 0 (mod ~t~0 4294967296)) (not (<= ~U~0 (* (div ~U~0 4294967296) 4294967296))) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967296)) (not (<= (div ~U~0 4294967296) (div ~u~0 4294967296)))) (or (< 0 (mod ~t~0 4294967296)) (<= (+ ~s~0 (* (div ~u~0 4294967296) 4294967296) (* (div (+ (* (- 1) ~s~0) (* (- 1) ~u~0) 4294967295 ~U~0 ~T~0 ~S~0) 4294967296) 4294967296)) (+ ~U~0 ~T~0 ~S~0)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (or (<= (+ 2 (* (div (+ (- 1) ~t~0) 4294967296) 4294967296)) ~t~0) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div ~S~0 4294967296) 4294967296) ~u~0 4294967297 (* (div ~T~0 4294967296) 4294967296))) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967295)) (not (<= (div ~U~0 4294967296) (div ~u~0 4294967296)))) (or (< 0 (mod ~t~0 4294967296)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967296)) (<= (+ ~s~0 (* (div ~T~0 4294967296) 4294967296)) (+ ~T~0 ~S~0 1)) (not (<= (div ~U~0 4294967296) (div ~u~0 4294967296)))) (or (<= (+ (* 4294967296 (div (+ (* (- 1) ~s~0) (* (- 1) ~u~0) 4294967294 ~U~0 ~T~0 ~S~0) 4294967296)) ~s~0 (* (div ~u~0 4294967296) 4294967296) 1) (+ ~U~0 ~T~0 ~S~0)) (<= (+ 2 (* (div (+ (- 1) ~t~0) 4294967296) 4294967296)) ~t~0) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967295)) (not (< 0 (mod ~t~0 4294967296))) (<= (+ ~s~0 (* (div ~u~0 4294967296) 4294967296) (* (div ~T~0 4294967296) 4294967296) 1) (+ ~U~0 ~T~0 ~S~0)) (not (<= (div ~U~0 4294967296) (div ~u~0 4294967296)))) (or (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div ~S~0 4294967296) 4294967296) ~u~0 4294967297 (* (div ~T~0 4294967296) 4294967296))) (< 0 (mod ~t~0 4294967296)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967296)) (not (<= (div ~U~0 4294967296) (div ~u~0 4294967296)))) (or (<= (+ 2 (* (div (+ (- 1) ~t~0) 4294967296) 4294967296)) ~t~0) (not (<= ~U~0 (* (div ~U~0 4294967296) 4294967296))) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967295)) (not (<= (div ~U~0 4294967296) (div ~u~0 4294967296)))) (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~m~0 0)) (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (not (<= (+ (div ~S~0 4294967296) 2) (div (+ ~s~0 1) 4294967296))) (not (< 0 (mod ~t~0 4294967296))) (not (<= (div ~U~0 4294967296) (div ~u~0 4294967296))))), 94081#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (div ~U~0 4294967296) (div ~u~0 4294967296))) (or (< 0 (mod ~t~0 4294967296)) (< (div ~u~0 4294967296) (+ (div ~U~0 4294967296) 1)) (< 0 (mod ~u~0 4294967296))) (or (<= 0 ~m~0) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967295))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967295))) (or (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~s~0) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967295)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~s~0) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (<= 0 ~m~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~s~0) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)))), 94087#(and (or (not (<= ~U~0 (* (div ~U~0 4294967296) 4294967296))) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (< 0 (mod ~u~0 4294967296)) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967295)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (or (< (div ~u~0 4294967296) (+ (div ~U~0 4294967296) 1)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (or (< 0 (mod ~t~0 4294967296)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (< 0 (mod ~u~0 4294967296)) (<= (+ (* (div ~S~0 4294967296) 4294967296) 3) ~s~0)) (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296)) (<= (+ 2 (* (div ~S~0 4294967296) 4294967296)) ~s~0)) (or (< 0 (mod ~t~0 4294967296)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (+ ~s~0 (* (div ~T~0 4294967296) 4294967296)) (+ ~T~0 ~S~0 1))) (or (< 0 (mod ~t~0 4294967296)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (< 0 (mod ~u~0 4294967296)) (<= (div ~U~0 4294967296) (div ~u~0 4294967296))) (or (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div ~S~0 4294967296) 4294967296) (* (div ~u~0 4294967296) 4294967296) 4294967297 (* (div ~T~0 4294967296) 4294967296))) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (< 0 (mod ~u~0 4294967296)) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967295)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (< 0 (mod ~u~0 4294967296)) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967295)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296)) (<= (+ ~s~0 (* (div ~T~0 4294967296) 4294967296)) (+ ~T~0 ~S~0))) (or (<= (+ ~s~0 (* (div ~u~0 4294967296) 4294967296) (* 4294967296 (div (+ (* (div ~u~0 4294967296) (- 4294967296)) (* (- 1) ~s~0) 4294967294 ~U~0 ~T~0 ~S~0) 4294967296)) 1) (+ ~U~0 ~T~0 ~S~0)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (or (< 0 (mod ~t~0 4294967296)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (< 0 (mod ~u~0 4294967296)) (= ~m~0 0)) (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (< 0 (mod ~u~0 4294967296)) (= ~m~0 0) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (or (< 0 (mod ~t~0 4294967296)) (< (div ~u~0 4294967296) (+ (div ~U~0 4294967296) 1)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (< 0 (mod ~u~0 4294967296))) (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (< 0 (mod ~u~0 4294967296)) (<= (div ~U~0 4294967296) (div ~u~0 4294967296)) (< 0 (mod (+ 4294967295 ~t~0) 4294967296))) (or (< 0 (mod ~t~0 4294967296)) (not (<= ~U~0 (* (div ~U~0 4294967296) 4294967296))) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (<= (+ (* (div (+ (* (div ~u~0 4294967296) (- 4294967296)) (* (- 1) ~s~0) 4294967295 ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~s~0 (* (div ~u~0 4294967296) 4294967296)) (+ ~U~0 ~T~0 ~S~0)) (< 0 (mod ~t~0 4294967296)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (< 0 (mod ~u~0 4294967296))) (or (< 0 (mod ~t~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div ~S~0 4294967296) 4294967296) (* (div ~u~0 4294967296) 4294967296) 4294967297 (* (div ~T~0 4294967296) 4294967296))) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967296)) (< 0 (mod ~u~0 4294967296)))), 94080#(and (or (<= 0 ~m~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~s~0) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967295)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967295))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (div ~u~0 4294967296) (+ (div ~U~0 4294967296) 1))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (div ~U~0 4294967296) (div ~u~0 4294967296))) (or (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~s~0) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~s~0) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (<= 0 ~m~0) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967295)))), 94076#(and (or (<= 0 ~m~0) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)))), 94083#(and (or (<= (* (div ~T~0 4294967296) 4294967296) ~t~0) (not (< 0 (mod ~u~0 4294967296)))) (or (not (<= ~t~0 (+ (* (div (+ (- 1) ~t~0) 4294967296) 4294967296) 1))) (<= (+ ~T~0 ~S~0) (+ ~t~0 ~s~0))) (or (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967296)) (not (< 0 (mod ~u~0 4294967296)))) (or (not (< 0 (mod ~u~0 4294967296))) (= ~m~0 0)) (or (< 0 (mod ~t~0 4294967296)) (not (< 0 (mod ~u~0 4294967296))) (<= (+ ~T~0 ~S~0) (+ ~t~0 ~s~0))) (or (not (< 0 (mod ~t~0 4294967296))) (= ~m~0 0)) (or (not (< 0 (mod ~u~0 4294967296))) (<= (+ (* (div ~t~0 4294967296) 4294967296) ~s~0) (+ ~T~0 ~S~0))) (or (<= ~t~0 (+ 4294967295 (* (div ~T~0 4294967296) 4294967296))) (not (< 0 (mod ~t~0 4294967296)))) (or (= ~u~0 ~U~0) (not (< 0 (mod ~t~0 4294967296)))) (or (<= (* (div ~T~0 4294967296) 4294967296) ~t~0) (not (< 0 (mod ~t~0 4294967296)))) (or (not (< 0 (mod ~t~0 4294967296))) (<= (+ ~s~0 (* (div (+ (- 1) ~t~0) 4294967296) 4294967296) 1) (+ ~T~0 ~S~0))) (or (< 0 (mod ~t~0 4294967296)) (not (< 0 (mod ~u~0 4294967296))) (<= (+ 2 (* (div ~S~0 4294967296) 4294967296)) ~s~0)) (or (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967295)) (not (< 0 (mod ~t~0 4294967296)))) (or (<= ~t~0 (+ 4294967295 (* (div ~T~0 4294967296) 4294967296))) (not (< 0 (mod ~u~0 4294967296)))) (or (= ~u~0 ~U~0) (not (< 0 (mod ~u~0 4294967296)))) (or (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~s~0) (not (< 0 (mod ~t~0 4294967296)))))] [2022-03-15 19:57:29,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 19:57:29,090 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:57:29,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 19:57:29,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=1851, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 19:57:29,091 INFO L87 Difference]: Start difference. First operand 1244 states and 4616 transitions. Second operand has 26 states, 25 states have (on average 3.88) internal successors, (97), 25 states have internal predecessors, (97), 0 states have call successors, (0), 0 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 19:58:26,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:58:26,038 INFO L93 Difference]: Finished difference Result 2871 states and 10008 transitions. [2022-03-15 19:58:26,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2022-03-15 19:58:26,039 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.88) internal successors, (97), 25 states have internal predecessors, (97), 0 states have call successors, (0), 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 19:58:26,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:58:26,044 INFO L225 Difference]: With dead ends: 2871 [2022-03-15 19:58:26,044 INFO L226 Difference]: Without dead ends: 2618 [2022-03-15 19:58:26,045 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 97 SyntacticMatches, 12 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7641 ImplicationChecksByTransitivity, 57.7s TimeCoverageRelationStatistics Valid=2735, Invalid=18726, Unknown=1, NotChecked=0, Total=21462 [2022-03-15 19:58:26,045 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 568 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 3280 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 3280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:58:26,046 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [568 Valid, 0 Invalid, 3538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 3280 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2022-03-15 19:58:26,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2618 states. [2022-03-15 19:58:26,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2618 to 1304. [2022-03-15 19:58:26,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1304 states, 1303 states have (on average 3.706830391404451) internal successors, (4830), 1303 states have internal predecessors, (4830), 0 states have call successors, (0), 0 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 19:58:26,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 4830 transitions. [2022-03-15 19:58:26,070 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 4830 transitions. Word has length 27 [2022-03-15 19:58:26,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:58:26,070 INFO L470 AbstractCegarLoop]: Abstraction has 1304 states and 4830 transitions. [2022-03-15 19:58:26,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.88) internal successors, (97), 25 states have internal predecessors, (97), 0 states have call successors, (0), 0 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 19:58:26,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 4830 transitions. [2022-03-15 19:58:26,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:58:26,072 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:58:26,073 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:58:26,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-03-15 19:58:26,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-03-15 19:58:26,273 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:58:26,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:58:26,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1234675781, now seen corresponding path program 6 times [2022-03-15 19:58:26,274 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:58:26,274 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726801792] [2022-03-15 19:58:26,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:58:26,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:58:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:58:26,882 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:58:26,883 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:58:26,883 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726801792] [2022-03-15 19:58:26,883 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726801792] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:58:26,883 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891769926] [2022-03-15 19:58:26,883 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:58:26,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:58:26,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:58:26,885 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:58:26,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-15 19:58:26,991 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 19:58:26,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:58:26,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 19:58:26,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:58:27,118 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:58:27,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:58:27,514 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:58:27,514 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891769926] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:58:27,514 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:58:27,514 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 18 [2022-03-15 19:58:27,514 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1417835999] [2022-03-15 19:58:27,514 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:58:27,517 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:58:27,534 INFO L252 McrAutomatonBuilder]: Finished intersection with 122 states and 261 transitions. [2022-03-15 19:58:27,534 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:58:35,865 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [99943#(and (or (<= (+ ~s~0 1) ~S~0) (not (< 0 (mod ~t~0 4294967296))) (not (<= ~S~0 (* (div ~S~0 4294967296) 4294967296))) (< (* (div ~T~0 4294967296) 4294967296) ~T~0)) (<= ~S~0 (+ ~s~0 1)) (or (<= ~s~0 ~S~0) (not (< 0 (mod ~t~0 4294967296))) (not (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)))) (or (<= ~S~0 ~s~0) (< 0 (mod ~t~0 4294967296))) (or (<= ~s~0 (+ ~S~0 1)) (not (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)))) (or (< 0 (mod ~t~0 4294967296)) (<= (+ ~S~0 1) ~s~0) (<= ~T~0 (* (div ~T~0 4294967296) 4294967296))) (or (<= ~t~0 (+ ~T~0 1)) (< (* (div ~T~0 4294967296) 4294967296) ~T~0)) (<= ~T~0 (+ ~t~0 1)) (<= ~t~0 (+ 4294967295 (* (div ~T~0 4294967296) 4294967296))) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967296)) (or (<= ~s~0 ~S~0) (< (* (div ~S~0 4294967296) 4294967296) ~S~0) (< (* (div ~T~0 4294967296) 4294967296) ~T~0)) (or (not (< 0 (mod ~t~0 4294967296))) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967294)) (< (* (div ~T~0 4294967296) 4294967296) ~T~0)) (or (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967295)) (not (< 0 (mod ~t~0 4294967296)))) (or (<= (mod ~t~0 4294967296) 0) (<= ~T~0 ~t~0)) (or (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967295)) (< (* (div ~T~0 4294967296) 4294967296) ~T~0)) (or (<= ~S~0 ~s~0) (<= ~T~0 (* (div ~T~0 4294967296) 4294967296)))), 99942#(and (<= ~S~0 (+ ~s~0 1)) (or (<= ~s~0 ~S~0) (not (<= ~S~0 (* (div ~S~0 4294967296) 4294967296))) (< (* (div ~T~0 4294967296) 4294967296) ~T~0)) (or (<= ~s~0 (+ ~S~0 1)) (not (<= ~S~0 (* (div ~S~0 4294967296) 4294967296)))) (<= ~T~0 (+ ~t~0 1)) (<= (* (div ~S~0 4294967296) 4294967296) ~s~0) (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967296)) (<= (* (div ~T~0 4294967296) 4294967296) ~t~0) (or (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967294)) (<= (+ (* (div ~S~0 4294967296) 4294967296) 4294967296) ~s~0)) (< (div (+ ~t~0 1) 4294967296) (+ (div ~T~0 4294967296) 1)) (or (<= ~S~0 ~s~0) (<= ~T~0 (* (div ~T~0 4294967296) 4294967296))) (or (<= ~s~0 (+ (* (div ~S~0 4294967296) 4294967296) 4294967294)) (< (* (div ~T~0 4294967296) 4294967296) ~T~0)))] [2022-03-15 19:58:35,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:58:35,865 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:58:35,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:58:35,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2022-03-15 19:58:35,866 INFO L87 Difference]: Start difference. First operand 1304 states and 4830 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 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 19:58:36,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:58:36,624 INFO L93 Difference]: Finished difference Result 2146 states and 7945 transitions. [2022-03-15 19:58:36,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 19:58:36,624 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 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 19:58:36,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:58:36,628 INFO L225 Difference]: With dead ends: 2146 [2022-03-15 19:58:36,628 INFO L226 Difference]: Without dead ends: 2142 [2022-03-15 19:58:36,628 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 110 SyntacticMatches, 26 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2022-03-15 19:58:36,628 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 23 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:58:36,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 26 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:58:36,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2142 states. [2022-03-15 19:58:36,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2142 to 1344. [2022-03-15 19:58:36,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1344 states, 1343 states have (on average 3.7170513775130307) internal successors, (4992), 1343 states have internal predecessors, (4992), 0 states have call successors, (0), 0 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 19:58:36,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 4992 transitions. [2022-03-15 19:58:36,649 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 4992 transitions. Word has length 27 [2022-03-15 19:58:36,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:58:36,650 INFO L470 AbstractCegarLoop]: Abstraction has 1344 states and 4992 transitions. [2022-03-15 19:58:36,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 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 19:58:36,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 4992 transitions. [2022-03-15 19:58:36,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:58:36,652 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:58:36,652 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:58:36,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-03-15 19:58:36,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-03-15 19:58:36,867 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:58:36,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:58:36,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1372598039, now seen corresponding path program 7 times [2022-03-15 19:58:36,868 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:58:36,869 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734486035] [2022-03-15 19:58:36,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:58:36,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:58:36,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:58:37,658 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:58:37,658 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:58:37,658 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734486035] [2022-03-15 19:58:37,658 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734486035] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:58:37,658 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171373032] [2022-03-15 19:58:37,658 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:58:37,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:58:37,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:58:37,660 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:58:37,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-03-15 19:58:37,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:58:37,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 19:58:37,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:58:38,857 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:58:38,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:58:47,344 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:58:47,344 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171373032] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:58:47,344 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:58:47,344 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 28 [2022-03-15 19:58:47,344 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1343187983] [2022-03-15 19:58:47,344 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:58:47,347 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:58:47,364 INFO L252 McrAutomatonBuilder]: Finished intersection with 112 states and 239 transitions. [2022-03-15 19:58:47,364 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:59:04,500 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [104981#(and (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* (div ~s~0 4294967296) 4294967296) 1) ~s~0) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (<= 0 ~m~0) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* (div ~s~0 4294967296) 4294967296) 1) ~s~0)) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (div ~t~0 4294967296) (+ (div ~T~0 4294967296) 1)) (<= (+ (* (div ~s~0 4294967296) 4294967296) 1) ~s~0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (<= (+ ~U~0 ~T~0 ~S~0 (* (div ~T~0 4294967296) 4294967296) (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~t~0 ~m~0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* (div ~s~0 4294967296) 4294967296) 1) ~s~0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)))), 104982#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 (mod ~t~0 4294967296)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (< 0 (mod ~u~0 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (<= 0 ~m~0) (< 0 (mod ~t~0 4294967296)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (< 0 (mod ~u~0 4294967296))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (< 0 (mod ~t~0 4294967296)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (<= 0 ~m~0) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))), 104975#(and (or (< 0 (mod ~t~0 4294967296)) (<= (+ (* (div (+ (* (- 1) ~S~0) (* (div ~S~0 4294967296) 4294967296) 4294967295 ~s~0 (* (div ~T~0 4294967296) 4294967296) (* (- 1) ~T~0)) 4294967296) 4294967296) 2) ~s~0) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~s~0 (+ (* 4294967296 (div (+ (- 1) ~s~0) 4294967296)) 1))) (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ ~s~0 (* (div ~T~0 4294967296) 4294967296)) (+ ~T~0 ~S~0))) (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (not (< 0 (mod ~t~0 4294967296))) (<= ~s~0 (* (div ~s~0 4294967296) 4294967296)) (<= (+ ~T~0 ~S~0) (+ (* (div ~S~0 4294967296) 4294967296) 4294967295 ~t~0))) (or (<= (+ ~T~0 ~S~0) (+ (* (div ~S~0 4294967296) 4294967296) ~t~0 4294967296)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= ~s~0 (+ (* 4294967296 (div (+ (- 1) ~s~0) 4294967296)) 1))) (or (<= ~t~0 (+ 4294967295 (* (div ~T~0 4294967296) 4294967296))) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (or (= ~u~0 ~U~0) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (<= (+ ~T~0 ~S~0) (+ ~t~0 ~s~0))) (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (not (< 0 (mod ~t~0 4294967296))) (<= ~s~0 (* (div ~s~0 4294967296) 4294967296)) (<= (+ (* (div (+ (* (- 1) ~S~0) (* (div ~S~0 4294967296) 4294967296) ~s~0 (* (div ~T~0 4294967296) 4294967296) 4294967296 (* (- 1) ~T~0)) 4294967296) 4294967296) 1) ~s~0)) (or (<= (+ ~s~0 (* (div ~T~0 4294967296) 4294967296) 1) (+ ~T~0 ~S~0)) (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (not (< 0 (mod ~t~0 4294967296)))) (or (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~m~0 0))), 104970#(and (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (<= 0 ~m~0) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)))), 104973#(and (or (<= 0 ~m~0) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)))), 104978#(and (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ (* (div ~s~0 4294967296) 4294967296) 1) ~s~0) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (<= 0 ~m~0) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ (* (div ~s~0 4294967296) 4294967296) 1) ~s~0)) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< (div ~t~0 4294967296) (+ (div ~T~0 4294967296) 1)) (<= (+ (* (div ~s~0 4294967296) 4294967296) 1) ~s~0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* (div ~T~0 4294967296) 4294967296) (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~t~0 ~m~0)) (<= (+ (* (div ~s~0 4294967296) 4294967296) 1) ~s~0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)))), 104987#(and (or (<= 0 ~m~0) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)))), 104979#(and (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ ~s~0 (* (div ~u~0 4294967296) 4294967296) (* (div ~T~0 4294967296) 4294967296)) (+ ~U~0 ~T~0 ~S~0))) (or (not (<= (+ (div ~T~0 4294967296) 1) (div ~t~0 4294967296))) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (= ~m~0 0)) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0) (+ 4294967295 (* (div ~s~0 4294967296) 4294967296) (* (div ~u~0 4294967296) 4294967296) (* (div ~T~0 4294967296) 4294967296))) (<= ~s~0 (+ (* (div (+ (- 2) ~s~0) 4294967296) 4294967296) 2)) (<= (+ 3 (* (div ~s~0 4294967296) 4294967296)) ~s~0)) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div ~S~0 4294967296) 4294967296) ~t~0 (* (div ~u~0 4294967296) 4294967296) 4294967297)) (<= ~s~0 (+ (* (div (+ (- 2) ~s~0) 4294967296) 4294967296) 2)) (<= (+ 3 (* (div ~s~0 4294967296) 4294967296)) ~s~0)) (or (<= (+ ~U~0 ~T~0 ~S~0) (+ ~t~0 ~s~0 (* (div ~u~0 4294967296) 4294967296))) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= ~s~0 (+ (* (div (+ (- 2) ~s~0) 4294967296) 4294967296) 2)) (<= (+ (* (div ~S~0 4294967296) 4294967296) ~s~0 (* (div ~u~0 4294967296) 4294967296) (* (div ~T~0 4294967296) 4294967296) 4294967296) (+ ~U~0 ~T~0 ~S~0 (* (div ~s~0 4294967296) 4294967296))) (<= (+ 3 (* (div ~s~0 4294967296) 4294967296)) ~s~0))), 104983#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (<= 0 ~m~0) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), 104976#(and (or (not (< 0 (mod ~t~0 4294967296))) (<= (+ ~T~0 ~S~0) (+ ~t~0 ~s~0))) (or (not (< 0 (mod ~t~0 4294967296))) (<= ~s~0 (* (div ~s~0 4294967296) 4294967296)) (<= (+ (* (div (+ (* (- 1) ~S~0) (* (div ~S~0 4294967296) 4294967296) ~s~0 (* (div ~T~0 4294967296) 4294967296) 4294967296 (* (- 1) ~T~0)) 4294967296) 4294967296) 1) ~s~0)) (or (not (< 0 (mod ~u~0 4294967296))) (= ~m~0 0)) (or (<= (+ ~s~0 (* (div ~T~0 4294967296) 4294967296) 1) (+ ~T~0 ~S~0)) (not (< 0 (mod ~t~0 4294967296)))) (or (not (< 0 (mod ~t~0 4294967296))) (<= ~s~0 (* (div ~s~0 4294967296) 4294967296)) (<= (+ ~T~0 ~S~0) (+ (* (div ~S~0 4294967296) 4294967296) 4294967295 ~t~0))) (or (not (< 0 (mod ~t~0 4294967296))) (= ~m~0 0)) (or (<= ~t~0 (+ 4294967295 (* (div ~T~0 4294967296) 4294967296))) (not (< 0 (mod ~t~0 4294967296)))) (or (= ~u~0 ~U~0) (not (< 0 (mod ~t~0 4294967296)))) (or (< 0 (mod ~t~0 4294967296)) (<= (+ (* (div (+ (* (- 1) ~S~0) (* (div ~S~0 4294967296) 4294967296) 4294967295 ~s~0 (* (div ~T~0 4294967296) 4294967296) (* (- 1) ~T~0)) 4294967296) 4294967296) 2) ~s~0) (not (< 0 (mod ~u~0 4294967296))) (<= ~s~0 (+ (* 4294967296 (div (+ (- 1) ~s~0) 4294967296)) 1))) (or (not (< 0 (mod ~u~0 4294967296))) (<= (+ ~s~0 (* (div ~T~0 4294967296) 4294967296)) (+ ~T~0 ~S~0))) (or (<= (+ ~T~0 ~S~0) (+ (* (div ~S~0 4294967296) 4294967296) ~t~0 4294967296)) (not (< 0 (mod ~u~0 4294967296))) (<= ~s~0 (+ (* 4294967296 (div (+ (- 1) ~s~0) 4294967296)) 1))) (or (not (< 0 (mod ~u~0 4294967296))) (<= (+ ~T~0 ~S~0) (+ ~t~0 ~s~0))) (or (<= ~t~0 (+ 4294967295 (* (div ~T~0 4294967296) 4294967296))) (not (< 0 (mod ~u~0 4294967296)))) (or (= ~u~0 ~U~0) (not (< 0 (mod ~u~0 4294967296))))), 104974#(and (or (<= 0 ~m~0) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)))), 104980#(and (or (<= 1 thread1Thread1of1ForFork2_~cond~0) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (<= 0 ~m~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= 0 ~m~0) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (<= 1 thread1Thread1of1ForFork2_~cond~0) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)))), 104988#(and (<= (+ ~U~0 ~T~0 ~S~0) (+ ~t~0 ~s~0 (* (div ~u~0 4294967296) 4294967296))) (or (<= (+ ~U~0 ~T~0 ~S~0) (+ (* (div ~S~0 4294967296) 4294967296) ~t~0 (* (div ~u~0 4294967296) 4294967296) 4294967296)) (<= ~s~0 (+ (* 4294967296 (div (+ (- 1) ~s~0) 4294967296)) 1))) (<= ~t~0 (+ 4294967295 (* (div ~T~0 4294967296) 4294967296))) (= ~m~0 0) (<= (+ ~s~0 (* (div ~u~0 4294967296) 4294967296) (* (div ~T~0 4294967296) 4294967296) 1) (+ ~U~0 ~T~0 ~S~0)) (or (<= (+ (* (div (+ (* (- 1) ~S~0) (* (div ~S~0 4294967296) 4294967296) (* (- 1) ~U~0) ~s~0 (* (div ~u~0 4294967296) 4294967296) (* (div ~T~0 4294967296) 4294967296) 4294967296 (* (- 1) ~T~0)) 4294967296) 4294967296) 2) ~s~0) (<= ~s~0 (+ (* 4294967296 (div (+ (- 1) ~s~0) 4294967296)) 1)))), 104986#(and (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< 0 (mod ~t~0 4294967296)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (<= 0 ~m~0) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< 0 (mod ~t~0 4294967296)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (< 0 (mod ~u~0 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (<= 0 ~m~0) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< 0 (mod ~t~0 4294967296)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (< 0 (mod ~u~0 4294967296))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))), 104977#(and (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (<= 0 ~m~0) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= 1 thread1Thread1of1ForFork2_~cond~0)) (or (<= 0 ~m~0) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))), 104985#(and (or (<= 0 ~m~0) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* (div ~s~0 4294967296) 4294967296) 1) ~s~0)) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* (div ~s~0 4294967296) 4294967296) 1) ~s~0) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* (div ~T~0 4294967296) 4294967296) (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~t~0 ~m~0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* (div ~s~0 4294967296) 4294967296) 1) ~s~0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (div ~t~0 4294967296) (+ (div ~T~0 4294967296) 1)) (<= (+ (* (div ~s~0 4294967296) 4294967296) 1) ~s~0) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)))), 104972#(and (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (<= 0 ~m~0) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)))), 104984#(and (or (<= 0 ~m~0) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (<= 1 thread1Thread1of1ForFork2_~cond~0) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (<= 0 ~m~0) (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (or (not (= (mod thread3Thread1of1ForFork1_~cond~2 256) 0)) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0))), 104971#(and (or (<= 0 ~m~0) (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (< (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0) (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296)) 1))) (or (not (= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ ~U~0 ~T~0 ~S~0 (* 4294967296 (div ~m~0 4294967296))) (+ (* (div (+ ~U~0 ~T~0 ~S~0) 4294967296) 4294967296) ~m~0))))] [2022-03-15 19:59:04,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 19:59:04,500 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:59:04,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 19:59:04,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=1942, Unknown=1, NotChecked=0, Total=2352 [2022-03-15 19:59:04,501 INFO L87 Difference]: Start difference. First operand 1344 states and 4992 transitions. Second operand has 31 states, 30 states have (on average 3.9) internal successors, (117), 30 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2022-03-15 19:59:24,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-03-15 19:59:24,902 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 89 SyntacticMatches, 12 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3271 ImplicationChecksByTransitivity, 28.7s TimeCoverageRelationStatistics Valid=1899, Invalid=9020, Unknown=1, NotChecked=0, Total=10920 [2022-03-15 19:59:24,902 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 321 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 1364 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 1364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:59:24,902 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [321 Valid, 0 Invalid, 1545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 1364 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-03-15 19:59:24,903 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-03-15 19:59:24,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-03-15 19:59:24,929 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 19:59:24,929 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 19:59:25,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:59:25,105 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (1344states) and FLOYD_HOARE automaton (currently 63 states, 31 states before enhancement),while ReachableStatesComputation was computing reachable states (578 states constructed, input type IntersectNwa). [2022-03-15 19:59:25,106 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 19:59:25,106 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 19:59:25,106 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 19:59:25,108 INFO L732 BasicCegarLoop]: Path program histogram: [8, 7, 7, 1, 1, 1] [2022-03-15 19:59:25,109 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 19:59:25,110 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 19:59:25,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 07:59:25 BasicIcfg [2022-03-15 19:59:25,111 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 19:59:25,112 INFO L158 Benchmark]: Toolchain (without parser) took 855130.81ms. Allocated memory was 205.5MB in the beginning and 671.1MB in the end (delta: 465.6MB). Free memory was 154.6MB in the beginning and 359.7MB in the end (delta: -205.1MB). Peak memory consumption was 261.9MB. Max. memory is 8.0GB. [2022-03-15 19:59:25,112 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 205.5MB. Free memory was 171.4MB in the beginning and 171.3MB in the end (delta: 74.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 19:59:25,112 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.62ms. Allocated memory is still 205.5MB. Free memory was 154.4MB in the beginning and 179.5MB in the end (delta: -25.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-03-15 19:59:25,112 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.89ms. Allocated memory is still 205.5MB. Free memory was 179.5MB in the beginning and 178.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 19:59:25,112 INFO L158 Benchmark]: Boogie Preprocessor took 28.87ms. Allocated memory is still 205.5MB. Free memory was 178.0MB in the beginning and 176.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 19:59:25,112 INFO L158 Benchmark]: RCFGBuilder took 372.60ms. Allocated memory is still 205.5MB. Free memory was 176.4MB in the beginning and 160.7MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-03-15 19:59:25,112 INFO L158 Benchmark]: TraceAbstraction took 854411.63ms. Allocated memory was 205.5MB in the beginning and 671.1MB in the end (delta: 465.6MB). Free memory was 160.1MB in the beginning and 359.7MB in the end (delta: -199.6MB). Peak memory consumption was 267.6MB. Max. memory is 8.0GB. [2022-03-15 19:59:25,113 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 205.5MB. Free memory was 171.4MB in the beginning and 171.3MB in the end (delta: 74.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 275.62ms. Allocated memory is still 205.5MB. Free memory was 154.4MB in the beginning and 179.5MB in the end (delta: -25.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.89ms. Allocated memory is still 205.5MB. Free memory was 179.5MB in the beginning and 178.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.87ms. Allocated memory is still 205.5MB. Free memory was 178.0MB in the beginning and 176.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 372.60ms. Allocated memory is still 205.5MB. Free memory was 176.4MB in the beginning and 160.7MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 854411.63ms. Allocated memory was 205.5MB in the beginning and 671.1MB in the end (delta: 465.6MB). Free memory was 160.1MB in the beginning and 359.7MB in the end (delta: -199.6MB). Peak memory consumption was 267.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 117 PlacesBefore, 36 PlacesAfterwards, 115 TransitionsBefore, 29 TransitionsAfterwards, 1010 CoEnabledTransitionPairs, 6 FixpointIterations, 63 TrivialSequentialCompositions, 19 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 6 ConcurrentYvCompositions, 5 ChoiceCompositions, 96 TotalNumberOfCompositions, 1742 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1411, positive: 1372, positive conditional: 0, positive unconditional: 1372, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 528, positive: 520, positive conditional: 0, positive unconditional: 520, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1411, positive: 852, positive conditional: 0, positive unconditional: 852, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 528, unknown conditional: 0, unknown unconditional: 528] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 80, Positive conditional cache size: 0, Positive unconditional cache size: 80, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 118]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (1344states) and FLOYD_HOARE automaton (currently 63 states, 31 states before enhancement),while ReachableStatesComputation was computing reachable states (578 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 112]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (1344states) and FLOYD_HOARE automaton (currently 63 states, 31 states before enhancement),while ReachableStatesComputation was computing reachable states (578 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 111]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (1344states) and FLOYD_HOARE automaton (currently 63 states, 31 states before enhancement),while ReachableStatesComputation was computing reachable states (578 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (1344states) and FLOYD_HOARE automaton (currently 63 states, 31 states before enhancement),while ReachableStatesComputation was computing reachable states (578 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 133 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 854.3s, OverallIterations: 25, TraceHistogramMax: 2, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.1s, AutomataDifference: 496.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.7s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 7777 SdHoareTripleChecker+Valid, 74.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7777 mSDsluCounter, 163 SdHoareTripleChecker+Invalid, 67.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13843 mSDsCounter, 3225 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36176 IncrementalHoareTripleChecker+Invalid, 39402 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3225 mSolverCounterUnsat, 57 mSDtfsCounter, 36176 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4265 GetRequests, 1979 SyntacticMatches, 498 SemanticMatches, 1788 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77236 ImplicationChecksByTransitivity, 502.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1402occurred in iteration=12, InterpolantAutomatonStates: 1252, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 24 MinimizatonAttempts, 21848 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 80.9s InterpolantComputationTime, 1159 NumberOfCodeBlocks, 1159 NumberOfCodeBlocksAsserted, 74 NumberOfCheckSat, 1618 ConstructedInterpolants, 0 QuantifiedInterpolants, 80614 SizeOfPredicates, 253 NumberOfNonLiveVariables, 3990 ConjunctsInSsa, 630 ConjunctsInUnsatCore, 68 InterpolantComputations, 4 PerfectInterpolantSequences, 36/287 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown