/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-more-sorted.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 19:31:46,179 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 19:31:46,211 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 19:31:46,260 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 19:31:46,260 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 19:31:46,264 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 19:31:46,266 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 19:31:46,269 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 19:31:46,271 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 19:31:46,276 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 19:31:46,276 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 19:31:46,277 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 19:31:46,277 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 19:31:46,278 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 19:31:46,279 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 19:31:46,280 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 19:31:46,280 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 19:31:46,281 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 19:31:46,282 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 19:31:46,283 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 19:31:46,284 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 19:31:46,289 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 19:31:46,293 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 19:31:46,294 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 19:31:46,301 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 19:31:46,302 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 19:31:46,302 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 19:31:46,303 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 19:31:46,304 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 19:31:46,304 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 19:31:46,304 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 19:31:46,305 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 19:31:46,306 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 19:31:46,307 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 19:31:46,308 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 19:31:46,308 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 19:31:46,309 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 19:31:46,309 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 19:31:46,309 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 19:31:46,310 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 19:31:46,310 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 19:31:46,311 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:31:46,344 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 19:31:46,344 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 19:31:46,345 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 19:31:46,345 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 19:31:46,346 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 19:31:46,346 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 19:31:46,346 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 19:31:46,346 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 19:31:46,346 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 19:31:46,347 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 19:31:46,347 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 19:31:46,347 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 19:31:46,348 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 19:31:46,348 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 19:31:46,348 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 19:31:46,348 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 19:31:46,348 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 19:31:46,348 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 19:31:46,348 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 19:31:46,348 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 19:31:46,349 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 19:31:46,349 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 19:31:46,349 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 19:31:46,349 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:31:46,349 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 19:31:46,349 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 19:31:46,349 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 19:31:46,349 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 19:31:46,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 19:31:46,350 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 19:31:46,350 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 19:31:46,350 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 19:31:46,350 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:31:46,561 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 19:31:46,583 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 19:31:46,585 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 19:31:46,585 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 19:31:46,586 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 19:31:46,587 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-sorted.wvr.c [2022-03-15 19:31:46,638 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19c8362a0/6e97581dc19a438fbd31efa547d61bf9/FLAG23f70f1db [2022-03-15 19:31:47,031 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 19:31:47,032 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sorted.wvr.c [2022-03-15 19:31:47,038 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19c8362a0/6e97581dc19a438fbd31efa547d61bf9/FLAG23f70f1db [2022-03-15 19:31:47,428 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19c8362a0/6e97581dc19a438fbd31efa547d61bf9 [2022-03-15 19:31:47,430 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 19:31:47,431 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 19:31:47,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 19:31:47,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 19:31:47,435 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 19:31:47,436 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:31:47" (1/1) ... [2022-03-15 19:31:47,437 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6513513b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:31:47, skipping insertion in model container [2022-03-15 19:31:47,437 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:31:47" (1/1) ... [2022-03-15 19:31:47,443 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 19:31:47,457 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 19:31:47,718 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-more-sorted.wvr.c[2434,2447] [2022-03-15 19:31:47,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:31:47,735 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 19:31:47,773 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-more-sorted.wvr.c[2434,2447] [2022-03-15 19:31:47,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:31:47,789 INFO L208 MainTranslator]: Completed translation [2022-03-15 19:31:47,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:31:47 WrapperNode [2022-03-15 19:31:47,790 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 19:31:47,791 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 19:31:47,791 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 19:31:47,791 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 19:31:47,797 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:31:47" (1/1) ... [2022-03-15 19:31:47,815 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:31:47" (1/1) ... [2022-03-15 19:31:47,841 INFO L137 Inliner]: procedures = 24, calls = 37, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 105 [2022-03-15 19:31:47,842 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 19:31:47,843 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 19:31:47,843 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 19:31:47,843 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 19:31:47,850 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:31:47" (1/1) ... [2022-03-15 19:31:47,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:31:47" (1/1) ... [2022-03-15 19:31:47,863 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:31:47" (1/1) ... [2022-03-15 19:31:47,863 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:31:47" (1/1) ... [2022-03-15 19:31:47,874 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:31:47" (1/1) ... [2022-03-15 19:31:47,878 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:31:47" (1/1) ... [2022-03-15 19:31:47,879 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:31:47" (1/1) ... [2022-03-15 19:31:47,881 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 19:31:47,882 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 19:31:47,882 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 19:31:47,882 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 19:31:47,890 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:31:47" (1/1) ... [2022-03-15 19:31:47,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:31:47,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:31:47,921 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:31:47,946 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:31:47,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 19:31:47,960 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 19:31:47,960 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 19:31:47,960 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 19:31:47,960 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 19:31:47,960 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 19:31:47,960 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 19:31:47,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 19:31:47,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 19:31:47,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 19:31:47,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 19:31:47,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 19:31:47,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 19:31:47,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 19:31:47,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 19:31:47,962 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:31:48,036 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 19:31:48,037 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 19:31:48,242 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 19:31:48,251 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 19:31:48,251 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-03-15 19:31:48,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:31:48 BoogieIcfgContainer [2022-03-15 19:31:48,253 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 19:31:48,255 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 19:31:48,255 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 19:31:48,258 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 19:31:48,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 07:31:47" (1/3) ... [2022-03-15 19:31:48,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3945ebca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:31:48, skipping insertion in model container [2022-03-15 19:31:48,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:31:47" (2/3) ... [2022-03-15 19:31:48,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3945ebca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:31:48, skipping insertion in model container [2022-03-15 19:31:48,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:31:48" (3/3) ... [2022-03-15 19:31:48,261 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-sorted.wvr.c [2022-03-15 19:31:48,265 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 19:31:48,265 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 19:31:48,265 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 19:31:48,265 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 19:31:48,348 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,349 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,349 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,350 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,350 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,351 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,351 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,351 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,352 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,352 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,352 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~short4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,352 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~short4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,353 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~short4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,353 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~short4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,353 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~short4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,353 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~short4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,353 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,354 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,354 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,354 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,354 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~short4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,355 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~short4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,355 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,355 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,356 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,356 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,356 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,356 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,356 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,356 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,357 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~short4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,357 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,357 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,357 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~short4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,358 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,358 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,358 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~short4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,358 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~short4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,358 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,358 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,359 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,359 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,359 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,359 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,359 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,359 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,360 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,360 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,360 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,361 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,361 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,361 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,361 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,362 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,362 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,362 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,362 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,362 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,363 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~short8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,363 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~short8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,363 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~short8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,364 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~short8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,364 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~short8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,364 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~short8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,364 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,364 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,365 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,365 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,365 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~short8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,365 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~short8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,366 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,366 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,366 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,366 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,367 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,367 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,367 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,367 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,368 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~short8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,368 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,368 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,368 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~short8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,369 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,369 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,369 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~short8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,369 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~short8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,370 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,370 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,370 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,370 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,370 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,370 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,371 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,371 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,371 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,371 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,372 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,372 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,372 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,373 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,373 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,373 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,374 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,374 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,374 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,374 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,374 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~short12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,375 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~short12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,375 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~short12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,375 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~short12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,375 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~short12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,376 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~short12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,376 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,376 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,376 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,376 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,377 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~short12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,377 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~short12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,377 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,377 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,378 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,378 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,378 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,378 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,378 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,378 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,379 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~short12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,379 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,379 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,379 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~short12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,380 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,380 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,380 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~short12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,380 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~short12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,380 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,380 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,380 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,381 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,381 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,381 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,381 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,381 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,381 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,382 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,385 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,385 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,385 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,385 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~short12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,385 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,385 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,386 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,388 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,388 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,388 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,388 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,388 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~short4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,388 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,389 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,389 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,390 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,390 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,390 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,390 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~short8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,390 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,390 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:31:48,395 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 19:31:48,432 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 19:31:48,438 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:31:48,438 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 19:31:48,456 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 19:31:48,464 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 184 transitions, 392 flow [2022-03-15 19:31:48,470 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 179 places, 184 transitions, 392 flow [2022-03-15 19:31:48,472 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 179 places, 184 transitions, 392 flow [2022-03-15 19:31:48,554 INFO L129 PetriNetUnfolder]: 15/181 cut-off events. [2022-03-15 19:31:48,554 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 19:31:48,558 INFO L84 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 181 events. 15/181 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 198 event pairs, 0 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 134. Up to 2 conditions per place. [2022-03-15 19:31:48,562 INFO L116 LiptonReduction]: Number of co-enabled transitions 3534 [2022-03-15 19:31:54,129 INFO L131 LiptonReduction]: Checked pairs total: 4306 [2022-03-15 19:31:54,129 INFO L133 LiptonReduction]: Total number of compositions: 189 [2022-03-15 19:31:54,138 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 32 transitions, 88 flow [2022-03-15 19:31:54,177 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 171 states, 170 states have (on average 3.588235294117647) internal successors, (610), 170 states have internal predecessors, (610), 0 states have call successors, (0), 0 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:31:54,180 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 170 states have (on average 3.588235294117647) internal successors, (610), 170 states have internal predecessors, (610), 0 states have call successors, (0), 0 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:31:54,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:31:54,189 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:31:54,189 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:31:54,190 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:31:54,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:31:54,194 INFO L85 PathProgramCache]: Analyzing trace with hash 127893293, now seen corresponding path program 1 times [2022-03-15 19:31:54,207 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:31:54,208 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903506428] [2022-03-15 19:31:54,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:31:54,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:31:54,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:31:54,498 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:31:54,499 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:31:54,499 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903506428] [2022-03-15 19:31:54,500 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903506428] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:31:54,500 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:31:54,500 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 19:31:54,501 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [866779710] [2022-03-15 19:31:54,502 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:31:54,510 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:31:54,548 INFO L252 McrAutomatonBuilder]: Finished intersection with 107 states and 244 transitions. [2022-03-15 19:31:54,549 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:31:55,161 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:31:55,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 19:31:55,163 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:31:55,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 19:31:55,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:31:55,188 INFO L87 Difference]: Start difference. First operand has 171 states, 170 states have (on average 3.588235294117647) internal successors, (610), 170 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 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:31:55,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:31:55,248 INFO L93 Difference]: Finished difference Result 172 states and 611 transitions. [2022-03-15 19:31:55,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 19:31:55,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 19:31:55,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:31:55,270 INFO L225 Difference]: With dead ends: 172 [2022-03-15 19:31:55,271 INFO L226 Difference]: Without dead ends: 172 [2022-03-15 19:31:55,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:31:55,277 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:31:55,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:31:55,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-03-15 19:31:55,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2022-03-15 19:31:55,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 3.573099415204678) internal successors, (611), 171 states have internal predecessors, (611), 0 states have call successors, (0), 0 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:31:55,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 611 transitions. [2022-03-15 19:31:55,346 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 611 transitions. Word has length 20 [2022-03-15 19:31:55,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:31:55,347 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 611 transitions. [2022-03-15 19:31:55,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 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:31:55,349 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 611 transitions. [2022-03-15 19:31:55,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:31:55,355 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:31:55,356 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:31:55,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 19:31:55,357 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:31:55,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:31:55,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1556133957, now seen corresponding path program 1 times [2022-03-15 19:31:55,361 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:31:55,364 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183499342] [2022-03-15 19:31:55,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:31:55,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:31:55,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:31:55,470 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:31:55,471 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:31:55,471 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183499342] [2022-03-15 19:31:55,471 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183499342] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:31:55,471 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:31:55,471 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 19:31:55,472 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [521686581] [2022-03-15 19:31:55,472 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:31:55,475 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:31:55,491 INFO L252 McrAutomatonBuilder]: Finished intersection with 108 states and 245 transitions. [2022-03-15 19:31:55,491 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:31:56,978 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:31:56,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 19:31:56,979 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:31:56,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 19:31:56,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:31:56,980 INFO L87 Difference]: Start difference. First operand 172 states and 611 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:31:57,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:31:57,040 INFO L93 Difference]: Finished difference Result 333 states and 1127 transitions. [2022-03-15 19:31:57,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 19:31:57,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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:31:57,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:31:57,044 INFO L225 Difference]: With dead ends: 333 [2022-03-15 19:31:57,044 INFO L226 Difference]: Without dead ends: 326 [2022-03-15 19:31:57,044 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 24 SyntacticMatches, 63 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:31:57,045 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:31:57,046 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:31:57,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-03-15 19:31:57,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 296. [2022-03-15 19:31:57,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 3.477966101694915) internal successors, (1026), 295 states have internal predecessors, (1026), 0 states have call successors, (0), 0 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:31:57,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 1026 transitions. [2022-03-15 19:31:57,063 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 1026 transitions. Word has length 21 [2022-03-15 19:31:57,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:31:57,064 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 1026 transitions. [2022-03-15 19:31:57,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:31:57,064 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 1026 transitions. [2022-03-15 19:31:57,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:31:57,066 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:31:57,066 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:31:57,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 19:31:57,066 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:31:57,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:31:57,067 INFO L85 PathProgramCache]: Analyzing trace with hash 228803158, now seen corresponding path program 1 times [2022-03-15 19:31:57,067 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:31:57,068 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305105939] [2022-03-15 19:31:57,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:31:57,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:31:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:31:57,231 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:31:57,232 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:31:57,232 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305105939] [2022-03-15 19:31:57,232 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305105939] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:31:57,232 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254077968] [2022-03-15 19:31:57,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:31:57,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:31:57,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:31:57,235 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:31:57,258 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:31:57,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:31:57,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 19:31:57,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:31:57,597 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:31:57,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:31:57,688 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:31:57,688 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254077968] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:31:57,688 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:31:57,689 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-03-15 19:31:57,689 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [740397764] [2022-03-15 19:31:57,689 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:31:57,693 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:31:57,715 INFO L252 McrAutomatonBuilder]: Finished intersection with 134 states and 316 transitions. [2022-03-15 19:31:57,716 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:31:59,092 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [2112#(or (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 2113#(or (<= ~N~0 (+ ~M~0 1)) (< (+ 2 ~M~0) ~N~0)), 2111#(< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)] [2022-03-15 19:31:59,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 19:31:59,093 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:31:59,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 19:31:59,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2022-03-15 19:31:59,094 INFO L87 Difference]: Start difference. First operand 296 states and 1026 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 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:31:59,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:31:59,288 INFO L93 Difference]: Finished difference Result 586 states and 1962 transitions. [2022-03-15 19:31:59,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 19:31:59,288 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:31:59,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:31:59,293 INFO L225 Difference]: With dead ends: 586 [2022-03-15 19:31:59,293 INFO L226 Difference]: Without dead ends: 572 [2022-03-15 19:31:59,294 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 98 SyntacticMatches, 45 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2022-03-15 19:31:59,294 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 103 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:31:59,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 25 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:31:59,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2022-03-15 19:31:59,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 502. [2022-03-15 19:31:59,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 501 states have (on average 3.4790419161676644) internal successors, (1743), 501 states have internal predecessors, (1743), 0 states have call successors, (0), 0 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:31:59,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 1743 transitions. [2022-03-15 19:31:59,316 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 1743 transitions. Word has length 22 [2022-03-15 19:31:59,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:31:59,316 INFO L470 AbstractCegarLoop]: Abstraction has 502 states and 1743 transitions. [2022-03-15 19:31:59,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 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:31:59,317 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 1743 transitions. [2022-03-15 19:31:59,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:31:59,318 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:31:59,318 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:31:59,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 19:31:59,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:31:59,548 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:31:59,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:31:59,549 INFO L85 PathProgramCache]: Analyzing trace with hash 259506122, now seen corresponding path program 1 times [2022-03-15 19:31:59,554 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:31:59,554 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805421381] [2022-03-15 19:31:59,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:31:59,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:31:59,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:31:59,651 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:31:59,651 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:31:59,651 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805421381] [2022-03-15 19:31:59,651 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805421381] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:31:59,651 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226821617] [2022-03-15 19:31:59,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:31:59,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:31:59,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:31:59,653 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:31:59,659 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:31:59,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:31:59,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 19:31:59,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:31:59,844 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:31:59,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:31:59,914 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:31:59,914 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226821617] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:31:59,915 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:31:59,915 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-03-15 19:31:59,915 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1196004945] [2022-03-15 19:31:59,915 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:31:59,921 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:31:59,937 INFO L252 McrAutomatonBuilder]: Finished intersection with 87 states and 177 transitions. [2022-03-15 19:31:59,937 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:32:00,378 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [3854#(< thread2Thread1of1ForFork2_~i~1 ~M~0), 3855#(< (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0), 3856#(or (< (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0) (<= ~M~0 thread2Thread1of1ForFork2_~i~1)), 3857#(or (<= ~M~0 0) (< 1 ~M~0))] [2022-03-15 19:32:00,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:32:00,378 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:32:00,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:32:00,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2022-03-15 19:32:00,379 INFO L87 Difference]: Start difference. First operand 502 states and 1743 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:32:00,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:32:00,594 INFO L93 Difference]: Finished difference Result 502 states and 1590 transitions. [2022-03-15 19:32:00,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:32:00,594 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 19:32:00,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:32:00,597 INFO L225 Difference]: With dead ends: 502 [2022-03-15 19:32:00,598 INFO L226 Difference]: Without dead ends: 472 [2022-03-15 19:32:00,598 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2022-03-15 19:32:00,599 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 107 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:32:00,599 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 20 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:32:00,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-03-15 19:32:00,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 438. [2022-03-15 19:32:00,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 437 states have (on average 3.2974828375286043) internal successors, (1441), 437 states have internal predecessors, (1441), 0 states have call successors, (0), 0 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:32:00,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1441 transitions. [2022-03-15 19:32:00,612 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1441 transitions. Word has length 23 [2022-03-15 19:32:00,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:32:00,613 INFO L470 AbstractCegarLoop]: Abstraction has 438 states and 1441 transitions. [2022-03-15 19:32:00,613 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:32:00,613 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1441 transitions. [2022-03-15 19:32:00,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:32:00,614 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:32:00,615 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:32:00,637 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:32:00,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-03-15 19:32:00,828 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:32:00,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:32:00,828 INFO L85 PathProgramCache]: Analyzing trace with hash -392934215, now seen corresponding path program 1 times [2022-03-15 19:32:00,829 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:32:00,829 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319382332] [2022-03-15 19:32:00,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:32:00,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:32:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:32:00,879 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:32:00,879 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:32:00,879 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319382332] [2022-03-15 19:32:00,879 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319382332] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:32:00,879 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68602091] [2022-03-15 19:32:00,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:32:00,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:32:00,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:32:00,881 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:32:00,890 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:32:00,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:32:00,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 19:32:00,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:32:01,043 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:32:01,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:32:01,102 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:32:01,102 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68602091] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:32:01,103 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:32:01,103 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-03-15 19:32:01,103 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [705091641] [2022-03-15 19:32:01,103 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:32:01,106 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:32:01,131 INFO L252 McrAutomatonBuilder]: Finished intersection with 145 states and 351 transitions. [2022-03-15 19:32:01,131 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:32:01,974 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:32:01,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 19:32:01,975 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:32:01,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 19:32:01,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-03-15 19:32:01,975 INFO L87 Difference]: Start difference. First operand 438 states and 1441 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 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:32:02,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:32:02,071 INFO L93 Difference]: Finished difference Result 350 states and 1145 transitions. [2022-03-15 19:32:02,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 19:32:02,072 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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:32:02,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:32:02,074 INFO L225 Difference]: With dead ends: 350 [2022-03-15 19:32:02,074 INFO L226 Difference]: Without dead ends: 297 [2022-03-15 19:32:02,074 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-03-15 19:32:02,075 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 13 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:32:02,075 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 18 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:32:02,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-03-15 19:32:02,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2022-03-15 19:32:02,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 3.4695945945945947) internal successors, (1027), 296 states have internal predecessors, (1027), 0 states have call successors, (0), 0 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:32:02,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 1027 transitions. [2022-03-15 19:32:02,085 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 1027 transitions. Word has length 23 [2022-03-15 19:32:02,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:32:02,085 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 1027 transitions. [2022-03-15 19:32:02,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 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:32:02,085 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 1027 transitions. [2022-03-15 19:32:02,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:32:02,086 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:32:02,086 INFO L514 BasicCegarLoop]: trace histogram [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:32:02,113 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:32:02,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:32:02,308 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:32:02,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:32:02,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1081286500, now seen corresponding path program 2 times [2022-03-15 19:32:02,309 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:32:02,309 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132014201] [2022-03-15 19:32:02,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:32:02,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:32:02,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:32:02,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:32:02,356 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:32:02,356 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132014201] [2022-03-15 19:32:02,356 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132014201] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:32:02,356 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888824647] [2022-03-15 19:32:02,357 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:32:02,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:32:02,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:32:02,358 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:32:02,367 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:32:02,448 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:32:02,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:32:02,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 19:32:02,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:32:02,513 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:32:02,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:32:02,569 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:32:02,570 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888824647] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 19:32:02,570 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 19:32:02,570 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2022-03-15 19:32:02,570 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [898727071] [2022-03-15 19:32:02,570 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:32:02,573 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:32:02,596 INFO L252 McrAutomatonBuilder]: Finished intersection with 135 states and 317 transitions. [2022-03-15 19:32:02,596 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:32:03,377 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:32:03,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 19:32:03,378 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:32:03,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 19:32:03,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-03-15 19:32:03,379 INFO L87 Difference]: Start difference. First operand 297 states and 1027 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 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:32:03,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:32:03,445 INFO L93 Difference]: Finished difference Result 281 states and 1016 transitions. [2022-03-15 19:32:03,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 19:32:03,446 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 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:32:03,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:32:03,448 INFO L225 Difference]: With dead ends: 281 [2022-03-15 19:32:03,448 INFO L226 Difference]: Without dead ends: 281 [2022-03-15 19:32:03,448 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 143 SyntacticMatches, 7 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-03-15 19:32:03,450 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 70 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:32:03,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 7 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:32:03,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-03-15 19:32:03,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2022-03-15 19:32:03,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 3.6285714285714286) internal successors, (1016), 280 states have internal predecessors, (1016), 0 states have call successors, (0), 0 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:32:03,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 1016 transitions. [2022-03-15 19:32:03,459 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 1016 transitions. Word has length 23 [2022-03-15 19:32:03,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:32:03,459 INFO L470 AbstractCegarLoop]: Abstraction has 281 states and 1016 transitions. [2022-03-15 19:32:03,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 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:32:03,460 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 1016 transitions. [2022-03-15 19:32:03,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:32:03,461 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:32:03,461 INFO L514 BasicCegarLoop]: trace histogram [2, 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:32:03,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 19:32:03,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:32:03,675 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:32:03,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:32:03,676 INFO L85 PathProgramCache]: Analyzing trace with hash 264245611, now seen corresponding path program 2 times [2022-03-15 19:32:03,677 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:32:03,677 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576590053] [2022-03-15 19:32:03,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:32:03,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:32:03,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:32:03,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:32:03,751 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:32:03,751 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576590053] [2022-03-15 19:32:03,752 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576590053] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:32:03,752 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763367374] [2022-03-15 19:32:03,752 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:32:03,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:32:03,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:32:03,753 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:32:03,770 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:32:03,875 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:32:03,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:32:03,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 19:32:03,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:32:03,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:32:03,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:32:04,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:32:04,060 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763367374] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 19:32:04,060 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 19:32:04,061 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 15 [2022-03-15 19:32:04,061 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [812528630] [2022-03-15 19:32:04,061 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:32:04,063 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:32:04,083 INFO L252 McrAutomatonBuilder]: Finished intersection with 146 states and 352 transitions. [2022-03-15 19:32:04,083 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:32:05,456 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [7478#(or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0)), 7477#(or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~M~0)), 7475#(< thread2Thread1of1ForFork2_~i~1 ~M~0), 7480#(or (< 0 ~M~0) (<= (+ 2 ~M~0) ~N~0)), 7476#(< 0 ~M~0), 7479#(or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= (+ 2 ~M~0) ~N~0))] [2022-03-15 19:32:05,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 19:32:05,456 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:32:05,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 19:32:05,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2022-03-15 19:32:05,457 INFO L87 Difference]: Start difference. First operand 281 states and 1016 transitions. Second operand has 14 states, 14 states have (on average 7.428571428571429) internal successors, (104), 13 states have internal predecessors, (104), 0 states have call successors, (0), 0 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:32:05,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:32:05,940 INFO L93 Difference]: Finished difference Result 535 states and 1996 transitions. [2022-03-15 19:32:05,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 19:32:05,941 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.428571428571429) internal successors, (104), 13 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:32:05,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:32:05,945 INFO L225 Difference]: With dead ends: 535 [2022-03-15 19:32:05,945 INFO L226 Difference]: Without dead ends: 535 [2022-03-15 19:32:05,945 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 146 SyntacticMatches, 8 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=242, Invalid=880, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:32:05,946 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 157 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:32:05,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 60 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:32:05,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2022-03-15 19:32:05,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 349. [2022-03-15 19:32:05,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 3.6810344827586206) internal successors, (1281), 348 states have internal predecessors, (1281), 0 states have call successors, (0), 0 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:32:05,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1281 transitions. [2022-03-15 19:32:05,959 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1281 transitions. Word has length 24 [2022-03-15 19:32:05,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:32:05,959 INFO L470 AbstractCegarLoop]: Abstraction has 349 states and 1281 transitions. [2022-03-15 19:32:05,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.428571428571429) internal successors, (104), 13 states have internal predecessors, (104), 0 states have call successors, (0), 0 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:32:05,960 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1281 transitions. [2022-03-15 19:32:05,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:32:05,962 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:32:05,962 INFO L514 BasicCegarLoop]: trace histogram [2, 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:32:05,991 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:32:06,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:32:06,178 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:32:06,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:32:06,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1319784880, now seen corresponding path program 1 times [2022-03-15 19:32:06,179 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:32:06,179 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922061786] [2022-03-15 19:32:06,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:32:06,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:32:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:32:06,240 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:32:06,240 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:32:06,240 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922061786] [2022-03-15 19:32:06,240 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922061786] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:32:06,240 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:32:06,240 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:32:06,241 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1786648412] [2022-03-15 19:32:06,241 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:32:06,244 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:32:06,273 INFO L252 McrAutomatonBuilder]: Finished intersection with 167 states and 407 transitions. [2022-03-15 19:32:06,273 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:32:07,504 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:32:07,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 19:32:07,504 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:32:07,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 19:32:07,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:32:07,505 INFO L87 Difference]: Start difference. First operand 349 states and 1281 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 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:32:07,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:32:07,550 INFO L93 Difference]: Finished difference Result 383 states and 1370 transitions. [2022-03-15 19:32:07,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 19:32:07,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:32:07,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:32:07,553 INFO L225 Difference]: With dead ends: 383 [2022-03-15 19:32:07,553 INFO L226 Difference]: Without dead ends: 383 [2022-03-15 19:32:07,554 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 92 SyntacticMatches, 52 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:32:07,554 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 4 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:32:07,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 5 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:32:07,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-03-15 19:32:07,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 333. [2022-03-15 19:32:07,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 3.61144578313253) internal successors, (1199), 332 states have internal predecessors, (1199), 0 states have call successors, (0), 0 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:32:07,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 1199 transitions. [2022-03-15 19:32:07,564 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 1199 transitions. Word has length 24 [2022-03-15 19:32:07,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:32:07,564 INFO L470 AbstractCegarLoop]: Abstraction has 333 states and 1199 transitions. [2022-03-15 19:32:07,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 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:32:07,564 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 1199 transitions. [2022-03-15 19:32:07,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:32:07,566 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:32:07,566 INFO L514 BasicCegarLoop]: trace histogram [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:32:07,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 19:32:07,566 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:32:07,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:32:07,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1770768798, now seen corresponding path program 1 times [2022-03-15 19:32:07,567 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:32:07,567 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279028619] [2022-03-15 19:32:07,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:32:07,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:32:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:32:08,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:32:08,525 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:32:08,525 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279028619] [2022-03-15 19:32:08,525 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279028619] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:32:08,525 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654578380] [2022-03-15 19:32:08,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:32:08,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:32:08,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:32:08,527 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:32:08,528 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:32:08,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:32:08,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-15 19:32:08,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:32:09,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:32:09,179 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:32:09,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:32:09,181 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:32:09,185 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:32:09,185 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 36 [2022-03-15 19:32:09,280 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:32:09,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:32:09,858 INFO L353 Elim1Store]: treesize reduction 67, result has 35.0 percent of original size [2022-03-15 19:32:09,858 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 43 [2022-03-15 19:32:09,933 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:32:09,934 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 86 [2022-03-15 19:32:10,369 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:32:10,369 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654578380] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:32:10,369 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:32:10,369 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 33 [2022-03-15 19:32:10,370 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [850240578] [2022-03-15 19:32:10,370 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:32:10,373 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:32:10,408 INFO L252 McrAutomatonBuilder]: Finished intersection with 184 states and 461 transitions. [2022-03-15 19:32:10,408 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:32:31,138 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 50 new interpolants: [9994#(and (or (= (* 256 (div ~sorted3~0 256)) ~sorted3~0) (< 0 ~M~0) (<= 1 ~sorted1~0)) (or (< 0 ~M~0) (<= ~sorted1~0 (+ (* (div ~sorted1~0 256) 256) 1))) (or (< 0 ~M~0) (= 0 (+ (- 1) ~sorted2~0))) (or (< 0 ~M~0) (= ~sorted3~0 0) (<= (div ~sorted1~0 256) 0)) (or (< 0 ~M~0) (not (<= (+ (div ~sorted1~0 256) 1) 0))) (or (< 0 ~M~0) (<= ~sorted1~0 (* (div ~sorted1~0 256) 256)) (not (= (+ (* (- 256) (div ~sorted3~0 256)) ~sorted3~0) 0)))), 9969#(and (or (= 0 (+ (- 1) ~sorted2~0)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (or (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (not (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))))) (not (= (+ (* (- 256) (div ~sorted3~0 256)) ~sorted3~0) 0))) (or (= (* 256 (div ~sorted3~0 256)) ~sorted3~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))))), 10014#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (< 0 ~M~0) (<= 2 ~N~0) (= 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (or (= (+ (- 1) ~sorted3~0) 0) (< 0 ~M~0)) (or (< 0 ~M~0) (<= thread3Thread1of1ForFork0_~i~2 0)) (or (< 0 ~M~0) (= ~sorted2~0 1))), 10016#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (< 0 ~M~0) (not (= (+ ~A~0.offset (* ~M~0 4)) 0)) (= thread1Thread1of1ForFork1_~i~0 0)) (or (< 0 ~M~0) (<= 2 ~N~0) (= (+ ~A~0.offset (* ~M~0 4)) 0)) (or (< 0 ~M~0) (= ~sorted2~0 1)) (or (< 0 ~M~0) (= ~sorted3~0 1))), 10009#(and (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= 2 ~N~0) (= (+ ~A~0.offset (* ~M~0 4)) 0)) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0)) (or (not (= (+ ~A~0.offset (* ~M~0 4)) 0)) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (= thread1Thread1of1ForFork1_~i~0 0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (= ~sorted2~0 1)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (= ~sorted3~0 1)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= ~M~0 0))), 10017#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (< 0 ~M~0) (<= 2 ~N~0)) (or (< 0 ~M~0) (= ~sorted2~0 1)) (or (< 0 ~M~0) (= ~sorted3~0 1))), 10012#(and (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= 2 ~N~0) (= 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (= ~sorted2~0 1)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= thread3Thread1of1ForFork0_~i~2 0)) (or (= (+ (- 1) ~sorted3~0) 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0))), 9988#(and (= ~A~0.offset 0) (or (not (= (+ ~A~0.offset (* ~M~0 4)) 0)) (<= 1 ~sorted1~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (not (= (+ ~A~0.offset (* ~M~0 4)) 0)) (<= ~sorted1~0 1)) (or (<= ~sorted1~0 0) (not (= (+ ~A~0.offset (* ~M~0 4)) 0)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)))) (= ~sorted2~0 1) (or (<= 2 ~N~0) (= (+ ~A~0.offset (* ~M~0 4)) 0)) (= ~sorted3~0 1) (or (not (= (+ ~A~0.offset (* ~M~0 4)) 0)) (not (<= (+ (div ~sorted1~0 256) 1) 0))) (<= ~M~0 0)), 9996#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (not (= 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (< 0 ~M~0) (not (<= (+ (div ~sorted1~0 256) 1) 0))) (or (not (= 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (< 0 ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (<= 1 ~sorted1~0)) (or (< 0 ~M~0) (<= 2 ~N~0) (= 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (or (< 0 ~M~0) (<= thread3Thread1of1ForFork0_~i~2 0)) (or (not (= 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (<= ~sorted1~0 0) (< 0 ~M~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4)))) (or (not (= 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (< 0 ~M~0) (<= ~sorted1~0 1)) (or (< 0 ~M~0) (= ~sorted2~0 1)) (or (< 0 ~M~0) (= ~sorted3~0 1))), 9987#(and (or (= 0 (+ (- 1) ~sorted2~0)) (not (< (+ ~M~0 1) ~N~0)) (< (+ 2 ~M~0) ~N~0)) (or (<= ~sorted1~0 (* (div ~sorted1~0 256) 256)) (not (< (+ ~M~0 1) ~N~0)) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4))) (< (+ 2 ~M~0) ~N~0)) (or (= (mod ~sorted3~0 256) 0) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)))) (not (< (+ ~M~0 1) ~N~0)) (<= 1 ~sorted1~0) (< (+ 2 ~M~0) ~N~0)) (or (not (<= (+ (div ~sorted1~0 256) 1) 0)) (not (< (+ ~M~0 1) ~N~0)) (< (+ 2 ~M~0) ~N~0)) (or (not (= (mod ~sorted3~0 256) 0)) (<= ~sorted1~0 (* (div ~sorted1~0 256) 256)) (not (< (+ ~M~0 1) ~N~0)) (< (+ 2 ~M~0) ~N~0)) (or (<= ~sorted1~0 (+ (* (div ~sorted1~0 256) 256) 1)) (<= ~N~0 (+ ~M~0 1)) (< (+ 2 ~M~0) ~N~0)) (or (= (mod ~sorted3~0 256) 0) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)))) (not (< (+ ~M~0 1) ~N~0)) (<= (div ~sorted1~0 256) 0) (< (+ 2 ~M~0) ~N~0))), 9997#(and (or (< 0 ~M~0) (= ~sorted3~0 0) (<= (div ~sorted1~0 256) 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (< 0 ~M~0) (not (<= (+ (div ~sorted1~0 256) 1) 0)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (< 0 ~M~0) (<= ~sorted1~0 (+ (* (div ~sorted1~0 256) 256) 1)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (< 0 ~M~0) (<= ~sorted1~0 (* (div ~sorted1~0 256) 256)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (not (= (+ (* (- 256) (div ~sorted3~0 256)) ~sorted3~0) 0))) (or (= (* 256 (div ~sorted3~0 256)) ~sorted3~0) (< 0 ~M~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 1 ~sorted1~0)) (or (< 0 ~M~0) (= 0 (+ (- 1) ~sorted2~0)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0))), 10004#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (< 0 ~M~0) (= 0 (+ (- 1) ~sorted2~0))) (or (< 0 ~M~0) (<= 2 ~N~0) (= 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (or (= (+ (- 1) ~sorted3~0) 0) (< 0 ~M~0)) (or (< 0 ~M~0) (<= thread3Thread1of1ForFork0_~i~2 0)) (or (not (= 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (< 0 ~M~0) (= thread1Thread1of1ForFork1_~i~0 0)) (or (not (= 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (< 0 ~M~0) (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))))), 10013#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (< 0 ~M~0) (= 0 (+ (- 1) ~sorted2~0))) (or (< 0 ~M~0) (<= 2 ~N~0) (= 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (or (= (+ (- 1) ~sorted3~0) 0) (< 0 ~M~0)) (or (< 0 ~M~0) (<= thread3Thread1of1ForFork0_~i~2 0)) (or (not (= 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (< 0 ~M~0) (= thread1Thread1of1ForFork1_~i~0 0))), 9993#(and (or (= 0 (+ (- 1) ~sorted2~0)) (= (mod ~sorted1~0 256) 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= ~N~0 1) (< 2 ~N~0)) (or (= (mod ~sorted1~0 256) 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= ~N~0 1) (not (= (+ (* (- 256) (div ~sorted3~0 256)) ~sorted3~0) 0)) (< 2 ~N~0)) (or (= (* 256 (div ~sorted3~0 256)) ~sorted3~0) (= (mod ~sorted1~0 256) 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (<= ~N~0 1) (< 2 ~N~0))), 9992#(and (or (= (* 256 (div ~sorted3~0 256)) ~sorted3~0) (= (mod ~sorted1~0 256) 0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (<= ~N~0 1) (< 2 ~N~0)) (or (= 0 (+ (- 1) ~sorted2~0)) (= (mod ~sorted1~0 256) 0) (<= ~N~0 1) (< 2 ~N~0)) (or (= (mod ~sorted1~0 256) 0) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= ~N~0 1) (not (= (+ (* (- 256) (div ~sorted3~0 256)) ~sorted3~0) 0)) (< 2 ~N~0))), 9998#(and (or (< 0 ~M~0) (not (<= (+ (div ~sorted1~0 256) 1) 0)) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (< 0 ~M~0) (= ~sorted3~0 0) (<= (div ~sorted1~0 256) 0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (* 256 (div ~sorted3~0 256)) ~sorted3~0) (< 0 ~M~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 1 ~sorted1~0)) (or (< 0 ~M~0) (<= ~sorted1~0 (+ (* (div ~sorted1~0 256) 256) 1)) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0) (<= ~sorted1~0 (* (div ~sorted1~0 256) 256)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (not (= (+ (* (- 256) (div ~sorted3~0 256)) ~sorted3~0) 0))) (or (< 0 ~M~0) (= 0 (+ (- 1) ~sorted2~0)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0))), 9978#(and (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= 2 ~N~0) (= 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0)) (or (not (= 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (not (<= (+ (div ~sorted1~0 256) 1) 0))) (or (not (= 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (<= 1 ~sorted1~0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (= ~sorted2~0 1)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= thread3Thread1of1ForFork0_~i~2 0)) (or (not (= 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (<= ~sorted1~0 1) (< thread2Thread1of1ForFork2_~i~1 ~M~0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (= ~sorted3~0 1)) (or (not (= 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (<= ~sorted1~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 1) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))) (< thread2Thread1of1ForFork2_~i~1 ~M~0))), 9991#(and (or (= (mod ~sorted1~0 256) 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= ~N~0 1) (not (= (+ (* (- 256) (div ~sorted3~0 256)) ~sorted3~0) 0)) (< 2 ~N~0)) (or (= 0 (+ (- 1) ~sorted2~0)) (= (mod ~sorted1~0 256) 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= ~N~0 1) (< 2 ~N~0)) (or (= (* 256 (div ~sorted3~0 256)) ~sorted3~0) (= (mod ~sorted1~0 256) 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (<= ~N~0 1) (< 2 ~N~0))), 9974#(and (or (= (* 256 (div ~sorted3~0 256)) ~sorted3~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))))) (or (= 0 (+ (- 1) ~sorted2~0)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~M~0)) (or (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (not (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))))) (not (= (+ (* (- 256) (div ~sorted3~0 256)) ~sorted3~0) 0)))), 9982#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= (mod ~sorted1~0 256) 0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (not (= (+ (* (- 256) (div ~sorted3~0 256)) ~sorted3~0) 0)) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (= (* 256 (div ~sorted3~0 256)) ~sorted3~0) (= (mod ~sorted1~0 256) 0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~M~0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= 0 (+ (- 1) ~sorted2~0)) (= (mod ~sorted1~0 256) 0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~M~0))), 9979#(and (or (not (= 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (not (= 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (= thread1Thread1of1ForFork1_~i~0 0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= 2 ~N~0) (= 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (or (= 0 (+ (- 1) ~sorted2~0)) (< thread2Thread1of1ForFork2_~i~1 ~M~0)) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= thread3Thread1of1ForFork0_~i~2 0)) (or (= (+ (- 1) ~sorted3~0) 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0))), 9980#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= (mod ~sorted1~0 256) 0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (not (= (+ (* (- 256) (div ~sorted3~0 256)) ~sorted3~0) 0)) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= 0 (+ (- 1) ~sorted2~0)) (= (mod ~sorted1~0 256) 0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (= (* 256 (div ~sorted3~0 256)) ~sorted3~0) (= (mod ~sorted1~0 256) 0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0))), 10007#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< 0 ~M~0) (= (mod ~sorted1~0 256) 0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (not (= (+ (* (- 256) (div ~sorted3~0 256)) ~sorted3~0) 0)) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< 0 ~M~0) (= 0 (+ (- 1) ~sorted2~0)) (= (mod ~sorted1~0 256) 0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (= (* 256 (div ~sorted3~0 256)) ~sorted3~0) (< 0 ~M~0) (= (mod ~sorted1~0 256) 0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0))), 9976#(and (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~sorted1~0 (* (div ~sorted1~0 256) 256)) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (not (= (+ (* (- 256) (div ~sorted3~0 256)) ~sorted3~0) 0))) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (= ~sorted3~0 0) (<= (div ~sorted1~0 256) 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (* 256 (div ~sorted3~0 256)) ~sorted3~0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 1 ~sorted1~0)) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (not (<= (+ (div ~sorted1~0 256) 1) 0)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (= 0 (+ (- 1) ~sorted2~0)) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~sorted1~0 (+ (* (div ~sorted1~0 256) 256) 1)) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0))), 9973#(and (or (<= ~sorted1~0 (+ (* (div ~sorted1~0 256) 256) 1)) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (= (* 256 (div ~sorted3~0 256)) ~sorted3~0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 1 ~sorted1~0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (= ~sorted3~0 0) (<= (div ~sorted1~0 256) 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (not (<= (+ (div ~sorted1~0 256) 1) 0)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (<= ~sorted1~0 (* (div ~sorted1~0 256) 256)) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (not (= (+ (* (- 256) (div ~sorted3~0 256)) ~sorted3~0) 0))) (or (= 0 (+ (- 1) ~sorted2~0)) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0))), 9972#(and (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (not (<= (+ (div ~sorted1~0 256) 1) 0))) (or (= 0 (+ (- 1) ~sorted2~0)) (< thread2Thread1of1ForFork2_~i~1 ~M~0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (= ~sorted3~0 0) (<= (div ~sorted1~0 256) 0)) (or (= (* 256 (div ~sorted3~0 256)) ~sorted3~0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= 1 ~sorted1~0)) (or (<= ~sorted1~0 (+ (* (div ~sorted1~0 256) 256) 1)) (< thread2Thread1of1ForFork2_~i~1 ~M~0)) (or (<= ~sorted1~0 (* (div ~sorted1~0 256) 256)) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (not (= (+ (* (- 256) (div ~sorted3~0 256)) ~sorted3~0) 0)))), 10001#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (< 0 ~M~0) (<= 2 ~N~0) (= (+ ~A~0.offset (* ~M~0 4)) 0)) (or (< 0 ~M~0) (not (= (+ ~A~0.offset (* ~M~0 4)) 0)) (not (<= (+ (div ~sorted1~0 256) 1) 0))) (or (< 0 ~M~0) (not (= (+ ~A~0.offset (* ~M~0 4)) 0)) (<= 1 ~sorted1~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (not (= (+ ~A~0.offset (* ~M~0 4)) 0)) (<= ~sorted1~0 1)) (or (< 0 ~M~0) (= ~sorted2~0 1)) (or (<= ~sorted1~0 0) (< 0 ~M~0) (not (= (+ ~A~0.offset (* ~M~0 4)) 0)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)))) (or (< 0 ~M~0) (= ~sorted3~0 1))), 10005#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (< 0 ~M~0) (not (= (+ ~A~0.offset (* ~M~0 4)) 0)) (= thread1Thread1of1ForFork1_~i~0 0)) (or (< 0 ~M~0) (<= 2 ~N~0) (= (+ ~A~0.offset (* ~M~0 4)) 0)) (or (< 0 ~M~0) (= ~sorted2~0 1)) (or (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) |thread1Thread1of1ForFork1_#t~mem2|) (< 0 ~M~0) (not (= (+ ~A~0.offset (* ~M~0 4)) 0))) (or (< 0 ~M~0) (= ~sorted3~0 1))), 9986#(and (or (= (mod ~sorted3~0 256) 0) (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4)))) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= 1 ~sorted1~0)) (or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (not (= (mod ~sorted3~0 256) 0)) (<= ~sorted1~0 (* (div ~sorted1~0 256) 256)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0)) (or (<= ~sorted1~0 (+ (* (div ~sorted1~0 256) 256) 1)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))) (or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (= 0 (+ (- 1) ~sorted2~0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0)) (or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (not (<= (+ (div ~sorted1~0 256) 1) 0)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0)) (or (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (<= ~sorted1~0 (* (div ~sorted1~0 256) 256)) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4)))) (or (= (mod ~sorted3~0 256) 0) (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4)))) (<= (div ~sorted1~0 256) 0) (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0))), 9983#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= (mod ~sorted1~0 256) 0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (not (= (+ (* (- 256) (div ~sorted3~0 256)) ~sorted3~0) 0)) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= 0 (+ (- 1) ~sorted2~0)) (= (mod ~sorted1~0 256) 0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~M~0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (= (* 256 (div ~sorted3~0 256)) ~sorted3~0) (= (mod ~sorted1~0 256) 0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0))), 9971#(and (or (= (* 256 (div ~sorted3~0 256)) ~sorted3~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))))) (or (= 0 (+ (- 1) ~sorted2~0)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (or (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (not (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))))) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (not (= (+ (* (- 256) (div ~sorted3~0 256)) ~sorted3~0) 0)))), 10006#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< 0 ~M~0) (= (mod ~sorted1~0 256) 0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (not (= (+ (* (- 256) (div ~sorted3~0 256)) ~sorted3~0) 0)) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (= (* 256 (div ~sorted3~0 256)) ~sorted3~0) (< 0 ~M~0) (= (mod ~sorted1~0 256) 0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< 0 ~M~0) (= 0 (+ (- 1) ~sorted2~0)) (= (mod ~sorted1~0 256) 0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0))), 9995#(and (or (< 0 ~M~0) (<= ~sorted1~0 (+ (* (div ~sorted1~0 256) 256) 1)) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (or (< 0 ~M~0) (= 0 (+ (- 1) ~sorted2~0))) (or (< 0 ~M~0) (not (<= (+ (div ~sorted1~0 256) 1) 0)) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (or (< 0 ~M~0) (= ~sorted3~0 0) (<= (div ~sorted1~0 256) 0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0) (<= ~sorted1~0 (* (div ~sorted1~0 256) 256)) (not (= (+ (* (- 256) (div ~sorted3~0 256)) ~sorted3~0) 0))) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (* 256 (div ~sorted3~0 256)) ~sorted3~0) (< 0 ~M~0) (<= 1 ~sorted1~0))), 10008#(and (= ~A~0.offset 0) (= ~sorted2~0 1) (or (<= 2 ~N~0) (= (+ ~A~0.offset (* ~M~0 4)) 0)) (= ~sorted3~0 1) (or (not (= (+ ~A~0.offset (* ~M~0 4)) 0)) (= thread1Thread1of1ForFork1_~i~0 0)) (<= ~M~0 0)), 10015#(and (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= 2 ~N~0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (= ~sorted2~0 1)) (or (= (+ (- 1) ~sorted3~0) 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= ~M~0 0))), 9977#(and (or (= (* 256 (div ~sorted3~0 256)) ~sorted3~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))))) (or (= 0 (+ (- 1) ~sorted2~0)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~M~0)) (or (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (not (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))))) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (not (= (+ (* (- 256) (div ~sorted3~0 256)) ~sorted3~0) 0)))), 9984#(and (or (not (= 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (= thread1Thread1of1ForFork1_~i~0 0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= 2 ~N~0) (= 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (or (= 0 (+ (- 1) ~sorted2~0)) (< thread2Thread1of1ForFork2_~i~1 ~M~0)) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= thread3Thread1of1ForFork0_~i~2 0)) (or (= (+ (- 1) ~sorted3~0) 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0))), 9970#(and (or (<= ~sorted1~0 (* (div ~sorted1~0 256) 256)) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (not (= (+ (* (- 256) (div ~sorted3~0 256)) ~sorted3~0) 0))) (or (= (* 256 (div ~sorted3~0 256)) ~sorted3~0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 1 ~sorted1~0)) (or (<= ~sorted1~0 (+ (* (div ~sorted1~0 256) 256) 1)) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (not (<= (+ (div ~sorted1~0 256) 1) 0)) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (= ~sorted3~0 0) (<= (div ~sorted1~0 256) 0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (= 0 (+ (- 1) ~sorted2~0)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0))), 10011#(and (or (< 0 ~M~0) (= (mod ~sorted1~0 256) 0) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= ~N~0 1) (not (= (+ (* (- 256) (div ~sorted3~0 256)) ~sorted3~0) 0)) (< 2 ~N~0)) (or (= (* 256 (div ~sorted3~0 256)) ~sorted3~0) (< 0 ~M~0) (= (mod ~sorted1~0 256) 0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (<= ~N~0 1) (< 2 ~N~0)) (or (< 0 ~M~0) (= 0 (+ (- 1) ~sorted2~0)) (= (mod ~sorted1~0 256) 0) (<= ~N~0 1) (< 2 ~N~0))), 9999#(and (or (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) |thread1Thread1of1ForFork1_#t~mem2|) (not (= (+ ~A~0.offset (* ~M~0 4)) 0))) (= ~A~0.offset 0) (= ~sorted2~0 1) (or (<= 2 ~N~0) (= (+ ~A~0.offset (* ~M~0 4)) 0)) (= ~sorted3~0 1) (or (not (= (+ ~A~0.offset (* ~M~0 4)) 0)) (= thread1Thread1of1ForFork1_~i~0 0)) (<= ~M~0 0)), 10002#(and (or (= (* 256 (div ~sorted3~0 256)) ~sorted3~0) (< 0 ~M~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))))) (or (< 0 ~M~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (not (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))))) (not (= (+ (* (- 256) (div ~sorted3~0 256)) ~sorted3~0) 0))) (or (< 0 ~M~0) (= 0 (+ (- 1) ~sorted2~0)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0))), 10010#(and (or (= (* 256 (div ~sorted3~0 256)) ~sorted3~0) (< 0 ~M~0) (= (mod ~sorted1~0 256) 0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (<= ~N~0 1) (< 2 ~N~0)) (or (< 0 ~M~0) (= 0 (+ (- 1) ~sorted2~0)) (= (mod ~sorted1~0 256) 0) (<= ~N~0 1) (< 2 ~N~0)) (or (< 0 ~M~0) (= (mod ~sorted1~0 256) 0) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= ~N~0 1) (not (= (+ (* (- 256) (div ~sorted3~0 256)) ~sorted3~0) 0)) (< 2 ~N~0))), 10003#(and (or (= (* 256 (div ~sorted3~0 256)) ~sorted3~0) (< 0 ~M~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))))) (or (< 0 ~M~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (not (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))))) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (not (= (+ (* (- 256) (div ~sorted3~0 256)) ~sorted3~0) 0))) (or (< 0 ~M~0) (= 0 (+ (- 1) ~sorted2~0)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0))), 9989#(and (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= 2 ~N~0) (= (+ ~A~0.offset (* ~M~0 4)) 0)) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0)) (or (not (= (+ ~A~0.offset (* ~M~0 4)) 0)) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= 1 ~sorted1~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (= ~sorted2~0 1)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (= ~sorted3~0 1)) (or (not (= (+ ~A~0.offset (* ~M~0 4)) 0)) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (not (<= (+ (div ~sorted1~0 256) 1) 0))) (or (<= ~sorted1~0 0) (not (= (+ ~A~0.offset (* ~M~0 4)) 0)) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)))) (or (not (= (+ ~A~0.offset (* ~M~0 4)) 0)) (<= ~sorted1~0 1) (< thread2Thread1of1ForFork2_~i~1 ~M~0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= ~M~0 0))), 9968#(and (or (= (* 256 (div ~sorted3~0 256)) ~sorted3~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 1 ~sorted1~0)) (or (not (<= (+ (div ~sorted1~0 256) 1) 0)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (<= ~sorted1~0 (* (div ~sorted1~0 256) 256)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (not (= (+ (* (- 256) (div ~sorted3~0 256)) ~sorted3~0) 0))) (or (= 0 (+ (- 1) ~sorted2~0)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (<= ~sorted1~0 (+ (* (div ~sorted1~0 256) 256) 1)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (= ~sorted3~0 0) (<= (div ~sorted1~0 256) 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0))), 9981#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (= (* 256 (div ~sorted3~0 256)) ~sorted3~0) (= (mod ~sorted1~0 256) 0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= (mod ~sorted1~0 256) 0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (not (= (+ (* (- 256) (div ~sorted3~0 256)) ~sorted3~0) 0)) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))))) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= 0 (+ (- 1) ~sorted2~0)) (= (mod ~sorted1~0 256) 0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0))), 9990#(and (or (= (mod ~sorted1~0 256) 0) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= ~N~0 1) (not (= (+ (* (- 256) (div ~sorted3~0 256)) ~sorted3~0) 0)) (< 2 ~N~0)) (or (= (* 256 (div ~sorted3~0 256)) ~sorted3~0) (= (mod ~sorted1~0 256) 0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (<= ~N~0 1) (< 2 ~N~0)) (or (= 0 (+ (- 1) ~sorted2~0)) (= (mod ~sorted1~0 256) 0) (<= ~N~0 1) (< 2 ~N~0))), 9975#(and (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~sorted1~0 (+ (* (div ~sorted1~0 256) 256) 1)) (< thread2Thread1of1ForFork2_~i~1 ~M~0)) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (not (<= (+ (div ~sorted1~0 256) 1) 0))) (or (= 0 (+ (- 1) ~sorted2~0)) (< thread2Thread1of1ForFork2_~i~1 ~M~0)) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (= ~sorted3~0 0) (<= (div ~sorted1~0 256) 0)) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~sorted1~0 (* (div ~sorted1~0 256) 256)) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (not (= (+ (* (- 256) (div ~sorted3~0 256)) ~sorted3~0) 0))) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= (* 256 (div ~sorted3~0 256)) ~sorted3~0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= 1 ~sorted1~0))), 10000#(and (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= 2 ~N~0) (= (+ ~A~0.offset (* ~M~0 4)) 0)) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0)) (or (not (= (+ ~A~0.offset (* ~M~0 4)) 0)) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (= thread1Thread1of1ForFork1_~i~0 0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (= ~sorted2~0 1)) (or (= (+ (- 1) ~sorted3~0) 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= ~M~0 0)) (or (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) |thread1Thread1of1ForFork1_#t~mem2|) (not (= (+ ~A~0.offset (* ~M~0 4)) 0)) (< thread2Thread1of1ForFork2_~i~1 ~M~0))), 9985#(and (or (not (<= (+ (div ~sorted1~0 256) 1) 0)) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (or (<= ~sorted1~0 (+ (* (div ~sorted1~0 256) 256) 1)) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (or (= (* 256 (div ~sorted3~0 256)) ~sorted3~0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 1 ~sorted1~0)) (or (= ~sorted3~0 0) (<= (div ~sorted1~0 256) 0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (or (= 0 (+ (- 1) ~sorted2~0)) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (or (<= ~sorted1~0 (* (div ~sorted1~0 256) 256)) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (not (= (+ (* (- 256) (div ~sorted3~0 256)) ~sorted3~0) 0))))] [2022-03-15 19:32:31,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-03-15 19:32:31,140 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:32:31,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-03-15 19:32:31,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=6502, Unknown=0, NotChecked=0, Total=6972 [2022-03-15 19:32:31,142 INFO L87 Difference]: Start difference. First operand 333 states and 1199 transitions. Second operand has 66 states, 65 states have (on average 3.8461538461538463) internal successors, (250), 65 states have internal predecessors, (250), 0 states have call successors, (0), 0 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:35:59,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:59,203 INFO L93 Difference]: Finished difference Result 4265 states and 15236 transitions. [2022-03-15 19:35:59,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 535 states. [2022-03-15 19:35:59,204 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 3.8461538461538463) internal successors, (250), 65 states have internal predecessors, (250), 0 states have call successors, (0), 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:35:59,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:59,230 INFO L225 Difference]: With dead ends: 4265 [2022-03-15 19:35:59,230 INFO L226 Difference]: Without dead ends: 4195 [2022-03-15 19:35:59,263 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 751 GetRequests, 123 SyntacticMatches, 15 SemanticMatches, 613 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157749 ImplicationChecksByTransitivity, 196.9s TimeCoverageRelationStatistics Valid=43198, Invalid=334412, Unknown=0, NotChecked=0, Total=377610 [2022-03-15 19:35:59,263 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 2278 mSDsluCounter, 3243 mSDsCounter, 0 mSdLazyCounter, 19657 mSolverCounterSat, 1063 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2278 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 20720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1063 IncrementalHoareTripleChecker+Valid, 19657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:59,264 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2278 Valid, 846 Invalid, 20720 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1063 Valid, 19657 Invalid, 0 Unknown, 0 Unchecked, 14.0s Time] [2022-03-15 19:35:59,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4195 states. [2022-03-15 19:35:59,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4195 to 539. [2022-03-15 19:35:59,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 538 states have (on average 3.920074349442379) internal successors, (2109), 538 states have internal predecessors, (2109), 0 states have call successors, (0), 0 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:35:59,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 2109 transitions. [2022-03-15 19:35:59,317 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 2109 transitions. Word has length 25 [2022-03-15 19:35:59,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:59,317 INFO L470 AbstractCegarLoop]: Abstraction has 539 states and 2109 transitions. [2022-03-15 19:35:59,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 3.8461538461538463) internal successors, (250), 65 states have internal predecessors, (250), 0 states have call successors, (0), 0 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:35:59,318 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 2109 transitions. [2022-03-15 19:35:59,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:35:59,319 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:59,320 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:59,347 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:35:59,527 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:35:59,527 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:35:59,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:59,528 INFO L85 PathProgramCache]: Analyzing trace with hash 870079802, now seen corresponding path program 1 times [2022-03-15 19:35:59,530 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:59,530 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101584634] [2022-03-15 19:35:59,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:59,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:59,991 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:35:59,992 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:59,992 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101584634] [2022-03-15 19:35:59,992 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101584634] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:59,992 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992310010] [2022-03-15 19:35:59,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:59,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:59,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:59,993 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:35:59,994 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:36:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:00,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-15 19:36:00,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:36:00,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:36:00,328 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-03-15 19:36:00,543 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:36:00,544 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 30 [2022-03-15 19:36:00,639 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:36:00,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:36:00,990 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (= (mod c_~sorted2~0 256) 0)) (.cse0 (= (mod c_~sorted3~0 256) 0))) (and (or .cse0 (forall ((v_ArrVal_391 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_391) c_~A~0.base))) (< (select .cse1 c_~A~0.offset) (select .cse1 (+ c_~A~0.offset 4))))) .cse2) (or (and (not .cse2) (not .cse0)) (forall ((v_ArrVal_391 (Array Int Int))) (not (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_391) c_~A~0.base))) (< (select .cse3 c_~A~0.offset) (select .cse3 (+ c_~A~0.offset 4))))))))) is different from false [2022-03-15 19:36:01,272 INFO L353 Elim1Store]: treesize reduction 39, result has 52.4 percent of original size [2022-03-15 19:36:01,273 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 70 [2022-03-15 19:36:01,280 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 19:36:01,280 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 18 [2022-03-15 19:36:01,423 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:36:01,441 INFO L353 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2022-03-15 19:36:01,442 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 34 [2022-03-15 19:36:01,539 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-03-15 19:36:01,539 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992310010] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:36:01,539 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:36:01,540 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 28 [2022-03-15 19:36:01,540 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1355024169] [2022-03-15 19:36:01,540 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:36:01,543 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:36:01,561 INFO L252 McrAutomatonBuilder]: Finished intersection with 109 states and 237 transitions. [2022-03-15 19:36:01,561 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:36:08,374 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:36:08,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 19:36:08,374 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:36:08,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 19:36:08,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=696, Unknown=2, NotChecked=54, Total=870 [2022-03-15 19:36:08,375 INFO L87 Difference]: Start difference. First operand 539 states and 2109 transitions. Second operand has 11 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 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:36:09,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:36:09,146 INFO L93 Difference]: Finished difference Result 1148 states and 4415 transitions. [2022-03-15 19:36:09,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 19:36:09,147 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:36:09,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:36:09,152 INFO L225 Difference]: With dead ends: 1148 [2022-03-15 19:36:09,153 INFO L226 Difference]: Without dead ends: 1141 [2022-03-15 19:36:09,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 36 SyntacticMatches, 75 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1929 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=227, Invalid=1257, Unknown=2, NotChecked=74, Total=1560 [2022-03-15 19:36:09,154 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 207 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:36:09,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 50 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:36:09,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2022-03-15 19:36:09,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 637. [2022-03-15 19:36:09,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 636 states have (on average 4.011006289308176) internal successors, (2551), 636 states have internal predecessors, (2551), 0 states have call successors, (0), 0 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:36:09,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 2551 transitions. [2022-03-15 19:36:09,179 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 2551 transitions. Word has length 26 [2022-03-15 19:36:09,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:36:09,179 INFO L470 AbstractCegarLoop]: Abstraction has 637 states and 2551 transitions. [2022-03-15 19:36:09,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 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:36:09,180 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 2551 transitions. [2022-03-15 19:36:09,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:36:09,182 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:36:09,182 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:36:09,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-03-15 19:36:09,399 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:36:09,400 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:36:09,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:36:09,400 INFO L85 PathProgramCache]: Analyzing trace with hash -186842694, now seen corresponding path program 2 times [2022-03-15 19:36:09,401 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:36:09,401 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490071360] [2022-03-15 19:36:09,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:36:09,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:36:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:09,873 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:36:09,873 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:36:09,873 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490071360] [2022-03-15 19:36:09,873 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490071360] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:36:09,873 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548021307] [2022-03-15 19:36:09,873 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:36:09,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:09,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:36:09,875 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:36:09,875 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:36:09,972 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:36:09,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:36:09,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-15 19:36:09,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:36:09,980 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 414 treesize of output 406 [2022-03-15 19:36:10,097 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:36:10,256 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:36:10,256 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 30 [2022-03-15 19:36:10,354 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:36:10,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:36:10,810 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_443 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_443) c_~A~0.base))) (or (not (< |c_thread2Thread1of1ForFork2_#t~mem6| (select .cse0 (+ c_~A~0.offset 4 (* c_thread2Thread1of1ForFork2_~i~1 4))))) (let ((.cse2 (= (mod c_~sorted3~0 256) 0)) (.cse1 (< (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 4))))) (and (or (not .cse1) (not .cse2)) (or .cse2 .cse1)))))) (forall ((v_ArrVal_443 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_443) c_~A~0.base))) (or (not (< (select .cse3 c_~A~0.offset) (select .cse3 (+ c_~A~0.offset 4)))) (< |c_thread2Thread1of1ForFork2_#t~mem6| (select .cse3 (+ c_~A~0.offset 4 (* c_thread2Thread1of1ForFork2_~i~1 4)))))))) is different from false [2022-03-15 19:36:10,850 INFO L353 Elim1Store]: treesize reduction 39, result has 52.4 percent of original size [2022-03-15 19:36:10,850 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 89 [2022-03-15 19:36:10,867 INFO L353 Elim1Store]: treesize reduction 16, result has 59.0 percent of original size [2022-03-15 19:36:10,868 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 48 [2022-03-15 19:36:11,012 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:36:11,027 INFO L353 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2022-03-15 19:36:11,028 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 34 [2022-03-15 19:36:11,115 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:36:11,115 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548021307] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:36:11,115 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:36:11,115 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2022-03-15 19:36:11,116 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1207486211] [2022-03-15 19:36:11,116 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:36:11,118 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:36:11,189 INFO L252 McrAutomatonBuilder]: Finished intersection with 146 states and 348 transitions. [2022-03-15 19:36:11,189 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:36:18,248 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [19222#(and (= ~A~0.offset 0) (or (not (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))))) (< |thread2Thread1of1ForFork2_#t~mem6| (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset 4)))) (or (not (< |thread2Thread1of1ForFork2_#t~mem6| (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset 4)))) (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread1Thread1of1ForFork1_~i~0 0) (= ~sorted3~0 1)), 19221#(and (<= ~sorted1~0 (+ (* (div ~sorted1~0 256) 256) 1)) (<= (div ~sorted1~0 256) 0) (= ~sorted3~0 1) (or (= ~sorted1~0 0) (< |thread2Thread1of1ForFork2_#t~mem6| (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset 4)))) (or (not (<= ~sorted1~0 (* (div ~sorted1~0 256) 256))) (not (< |thread2Thread1of1ForFork2_#t~mem6| (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset 4)))))), 19220#(and (<= (div ~sorted2~0 256) 0) (or (<= ~sorted2~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~A~0.offset 0) (or (<= 1 ~sorted2~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (= ~sorted3~0 1) (not (<= (+ (div ~sorted2~0 256) 1) 0)))] [2022-03-15 19:36:18,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 19:36:18,249 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:36:18,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 19:36:18,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=614, Unknown=1, NotChecked=50, Total=756 [2022-03-15 19:36:18,249 INFO L87 Difference]: Start difference. First operand 637 states and 2551 transitions. Second operand has 14 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 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:36:19,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:36:19,260 INFO L93 Difference]: Finished difference Result 1286 states and 4969 transitions. [2022-03-15 19:36:19,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 19:36:19,261 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:36:19,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:36:19,268 INFO L225 Difference]: With dead ends: 1286 [2022-03-15 19:36:19,269 INFO L226 Difference]: Without dead ends: 1279 [2022-03-15 19:36:19,269 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 109 SyntacticMatches, 42 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 970 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=263, Invalid=1300, Unknown=1, NotChecked=76, Total=1640 [2022-03-15 19:36:19,269 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 205 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:36:19,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 86 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:36:19,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2022-03-15 19:36:19,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 675. [2022-03-15 19:36:19,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 674 states have (on average 3.983679525222552) internal successors, (2685), 674 states have internal predecessors, (2685), 0 states have call successors, (0), 0 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:36:19,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 2685 transitions. [2022-03-15 19:36:19,292 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 2685 transitions. Word has length 26 [2022-03-15 19:36:19,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:36:19,293 INFO L470 AbstractCegarLoop]: Abstraction has 675 states and 2685 transitions. [2022-03-15 19:36:19,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 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:36:19,293 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 2685 transitions. [2022-03-15 19:36:19,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:36:19,295 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:36:19,295 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] [2022-03-15 19:36:19,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-15 19:36:19,511 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:36:19,512 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:36:19,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:36:19,512 INFO L85 PathProgramCache]: Analyzing trace with hash 987064041, now seen corresponding path program 2 times [2022-03-15 19:36:19,513 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:36:19,513 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603326884] [2022-03-15 19:36:19,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:36:19,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:36:19,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:19,635 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:36:19,635 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:36:19,635 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603326884] [2022-03-15 19:36:19,636 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603326884] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:36:19,636 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800838662] [2022-03-15 19:36:19,636 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:36:19,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:19,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:36:19,637 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:36:19,664 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:36:19,752 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:36:19,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:36:19,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 19:36:19,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:36:20,038 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:20,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:36:20,099 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:36:20,100 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 72 [2022-03-15 19:36:20,230 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:20,231 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800838662] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:36:20,231 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:36:20,231 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2022-03-15 19:36:20,231 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1881507795] [2022-03-15 19:36:20,231 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:36:20,235 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:36:20,288 INFO L252 McrAutomatonBuilder]: Finished intersection with 222 states and 570 transitions. [2022-03-15 19:36:20,288 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:36:22,967 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [22055#(< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0), 22056#(or (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 22057#(or (< (+ 3 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2))), 22058#(or (< (+ 3 ~M~0) ~N~0) (<= ~N~0 (+ 2 ~M~0)))] [2022-03-15 19:36:22,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 19:36:22,967 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:36:22,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 19:36:22,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2022-03-15 19:36:22,967 INFO L87 Difference]: Start difference. First operand 675 states and 2685 transitions. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 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:36:23,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:36:23,177 INFO L93 Difference]: Finished difference Result 1405 states and 5522 transitions. [2022-03-15 19:36:23,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 19:36:23,177 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 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 26 [2022-03-15 19:36:23,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:36:23,184 INFO L225 Difference]: With dead ends: 1405 [2022-03-15 19:36:23,184 INFO L226 Difference]: Without dead ends: 1385 [2022-03-15 19:36:23,184 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 228 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2022-03-15 19:36:23,185 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 153 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:36:23,185 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 39 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:36:23,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2022-03-15 19:36:23,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1207. [2022-03-15 19:36:23,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1207 states, 1206 states have (on average 4.041459369817579) internal successors, (4874), 1206 states have internal predecessors, (4874), 0 states have call successors, (0), 0 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:36:23,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 4874 transitions. [2022-03-15 19:36:23,219 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 4874 transitions. Word has length 26 [2022-03-15 19:36:23,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:36:23,219 INFO L470 AbstractCegarLoop]: Abstraction has 1207 states and 4874 transitions. [2022-03-15 19:36:23,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 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:36:23,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 4874 transitions. [2022-03-15 19:36:23,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:36:23,223 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:36:23,223 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:36:23,253 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:36:23,448 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:36:23,448 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:36:23,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:36:23,448 INFO L85 PathProgramCache]: Analyzing trace with hash 2087509712, now seen corresponding path program 1 times [2022-03-15 19:36:23,449 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:36:23,449 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750465138] [2022-03-15 19:36:23,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:36:23,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:36:23,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:23,523 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:36:23,523 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:36:23,523 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750465138] [2022-03-15 19:36:23,523 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750465138] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:36:23,523 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298116211] [2022-03-15 19:36:23,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:36:23,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:23,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:36:23,524 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:36:23,525 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:36:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:23,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 19:36:23,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:36:23,698 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:36:23,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:36:23,773 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:36:23,773 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298116211] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:36:23,773 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:36:23,773 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-03-15 19:36:23,774 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [978241933] [2022-03-15 19:36:23,774 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:36:23,776 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:36:23,816 INFO L252 McrAutomatonBuilder]: Finished intersection with 211 states and 539 transitions. [2022-03-15 19:36:23,816 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:36:25,929 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [26051#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= ~N~0 2)) (or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (= thread1Thread1of1ForFork1_~i~0 0)))] [2022-03-15 19:36:25,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 19:36:25,930 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:36:25,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 19:36:25,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2022-03-15 19:36:25,930 INFO L87 Difference]: Start difference. First operand 1207 states and 4874 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 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:36:26,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:36:26,074 INFO L93 Difference]: Finished difference Result 1233 states and 4524 transitions. [2022-03-15 19:36:26,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 19:36:26,075 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 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 26 [2022-03-15 19:36:26,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:36:26,080 INFO L225 Difference]: With dead ends: 1233 [2022-03-15 19:36:26,080 INFO L226 Difference]: Without dead ends: 1181 [2022-03-15 19:36:26,080 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 223 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2022-03-15 19:36:26,081 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 74 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:36:26,081 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 34 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:36:26,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2022-03-15 19:36:26,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1125. [2022-03-15 19:36:26,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1124 states have (on average 3.762455516014235) internal successors, (4229), 1124 states have internal predecessors, (4229), 0 states have call successors, (0), 0 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:36:26,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 4229 transitions. [2022-03-15 19:36:26,108 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 4229 transitions. Word has length 26 [2022-03-15 19:36:26,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:36:26,108 INFO L470 AbstractCegarLoop]: Abstraction has 1125 states and 4229 transitions. [2022-03-15 19:36:26,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 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:36:26,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 4229 transitions. [2022-03-15 19:36:26,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:36:26,112 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:36:26,112 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:36:26,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-15 19:36:26,335 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:36:26,335 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:36:26,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:36:26,335 INFO L85 PathProgramCache]: Analyzing trace with hash 2039905494, now seen corresponding path program 3 times [2022-03-15 19:36:26,336 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:36:26,336 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943329290] [2022-03-15 19:36:26,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:36:26,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:36:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:26,798 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:36:26,798 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:36:26,798 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943329290] [2022-03-15 19:36:26,799 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943329290] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:36:26,799 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371133634] [2022-03-15 19:36:26,799 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:36:26,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:26,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:36:26,800 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:36:26,827 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:36:27,008 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:36:27,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:36:27,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 19:36:27,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:36:27,276 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:36:27,277 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 30 [2022-03-15 19:36:27,376 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:36:27,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:36:27,738 INFO L353 Elim1Store]: treesize reduction 67, result has 35.0 percent of original size [2022-03-15 19:36:27,738 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 43 [2022-03-15 19:36:27,773 INFO L353 Elim1Store]: treesize reduction 94, result has 8.7 percent of original size [2022-03-15 19:36:27,773 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 34 [2022-03-15 19:36:27,891 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:36:27,891 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371133634] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:36:27,891 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:36:27,891 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-03-15 19:36:27,891 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [894206059] [2022-03-15 19:36:27,891 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:36:27,895 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:36:27,951 INFO L252 McrAutomatonBuilder]: Finished intersection with 226 states and 585 transitions. [2022-03-15 19:36:27,952 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:36:43,690 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [29713#(and (or (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset 4)))) (= (mod ~sorted2~0 256) 0) (<= 1 ~sorted1~0)) (or (< 0 (+ (div ~sorted1~0 256) 1)) (= (mod ~sorted2~0 256) 0)) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset 4))) (<= ~sorted1~0 (* (div ~sorted1~0 256) 256)) (= (mod ~sorted2~0 256) 0)) (or (= (mod ~sorted2~0 256) 0) (<= (div ~sorted1~0 256) 0)) (or (<= ~sorted1~0 (+ (* (div ~sorted1~0 256) 256) 1)) (= (mod ~sorted2~0 256) 0)) (or (= (mod ~sorted2~0 256) 0) (= ~sorted3~0 1))), 29719#(and (or (= (mod ~sorted2~0 256) 0) (= thread1Thread1of1ForFork1_~i~0 0)) (or (<= (+ |thread1Thread1of1ForFork1_#t~mem2| 1) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (= (mod ~sorted2~0 256) 0) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))))) (or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))) |thread1Thread1of1ForFork1_#t~mem2|) (= (mod ~sorted2~0 256) 0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (or (= ~A~0.offset 0) (= (mod ~sorted2~0 256) 0)) (or (= (mod ~sorted2~0 256) 0) (= ~sorted3~0 1))), 29712#(and (< 0 (+ (div ~sorted1~0 256) 1)) (or (<= ~sorted1~0 (* (div ~sorted1~0 256) 256)) (< |thread2Thread1of1ForFork2_#t~mem6| (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset 4)))) (<= ~sorted1~0 (+ (* (div ~sorted1~0 256) 256) 1)) (<= (div ~sorted1~0 256) 0) (= ~sorted3~0 1) (or (<= 1 ~sorted1~0) (not (< |thread2Thread1of1ForFork2_#t~mem6| (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset 4)))))), 29716#(and (or (<= (+ |thread1Thread1of1ForFork1_#t~mem2| 1) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (not (< |thread2Thread1of1ForFork2_#t~mem6| (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset 4))))) (= ~A~0.offset 0) (or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))) |thread1Thread1of1ForFork1_#t~mem2|) (< |thread2Thread1of1ForFork2_#t~mem6| (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset 4)))) (= thread1Thread1of1ForFork1_~i~0 0) (= ~sorted3~0 1)), 29718#(and (= ~A~0.offset 0) (= |thread2Thread1of1ForFork2_#t~mem6| (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~sorted3~0 1) (= thread2Thread1of1ForFork2_~i~1 0)), 29717#(and (or (= (mod ~sorted2~0 256) 0) (= thread1Thread1of1ForFork1_~i~0 0)) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset 4))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))) |thread1Thread1of1ForFork1_#t~mem2|) (= (mod ~sorted2~0 256) 0)) (or (<= (+ |thread1Thread1of1ForFork1_#t~mem2| 1) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset 4)))) (= (mod ~sorted2~0 256) 0)) (or (= ~A~0.offset 0) (= (mod ~sorted2~0 256) 0)) (or (= (mod ~sorted2~0 256) 0) (= ~sorted3~0 1))), 29715#(and (or (< 0 (+ (div ~sorted1~0 256) 1)) (= (mod ~sorted2~0 256) 0)) (or (= (mod ~sorted2~0 256) 0) (<= (div ~sorted1~0 256) 0)) (or (= (mod ~sorted2~0 256) 0) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= 1 ~sorted1~0)) (or (<= ~sorted1~0 (+ (* (div ~sorted1~0 256) 256) 1)) (= (mod ~sorted2~0 256) 0)) (or (= (mod ~sorted2~0 256) 0) (= ~sorted3~0 1)) (or (<= ~sorted1~0 (* (div ~sorted1~0 256) 256)) (= (mod ~sorted2~0 256) 0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))))), 29720#(and (= ~A~0.offset 0) (= ~sorted2~0 1) (= thread1Thread1of1ForFork1_~i~0 0) (= ~sorted3~0 1)), 29714#(and (or (<= (div ~sorted2~0 256) 0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (or (<= ~sorted2~0 (* (div ~sorted2~0 256) 256)) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (= ~A~0.offset 0) (or (<= 1 ~sorted2~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (< 0 (+ (div ~sorted2~0 256) 1)) (= ~sorted3~0 1))] [2022-03-15 19:36:43,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:36:43,690 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:36:43,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:36:43,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=762, Unknown=0, NotChecked=0, Total=870 [2022-03-15 19:36:43,691 INFO L87 Difference]: Start difference. First operand 1125 states and 4229 transitions. Second operand has 19 states, 18 states have (on average 6.666666666666667) internal successors, (120), 18 states have internal predecessors, (120), 0 states have call successors, (0), 0 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:36:51,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:36:51,349 INFO L93 Difference]: Finished difference Result 8378 states and 31206 transitions. [2022-03-15 19:36:51,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-03-15 19:36:51,349 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 6.666666666666667) internal successors, (120), 18 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:36:51,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:36:51,388 INFO L225 Difference]: With dead ends: 8378 [2022-03-15 19:36:51,388 INFO L226 Difference]: Without dead ends: 8125 [2022-03-15 19:36:51,389 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 140 SyntacticMatches, 91 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3166 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=1142, Invalid=6340, Unknown=0, NotChecked=0, Total=7482 [2022-03-15 19:36:51,390 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 316 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 3521 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 3665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 3521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:36:51,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [316 Valid, 374 Invalid, 3665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 3521 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-15 19:36:51,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8125 states. [2022-03-15 19:36:51,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8125 to 2360. [2022-03-15 19:36:51,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2360 states, 2359 states have (on average 4.37643069097075) internal successors, (10324), 2359 states have internal predecessors, (10324), 0 states have call successors, (0), 0 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:36:51,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2360 states to 2360 states and 10324 transitions. [2022-03-15 19:36:51,512 INFO L78 Accepts]: Start accepts. Automaton has 2360 states and 10324 transitions. Word has length 26 [2022-03-15 19:36:51,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:36:51,512 INFO L470 AbstractCegarLoop]: Abstraction has 2360 states and 10324 transitions. [2022-03-15 19:36:51,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 6.666666666666667) internal successors, (120), 18 states have internal predecessors, (120), 0 states have call successors, (0), 0 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:36:51,512 INFO L276 IsEmpty]: Start isEmpty. Operand 2360 states and 10324 transitions. [2022-03-15 19:36:51,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:36:51,519 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:36:51,519 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:36:51,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 19:36:51,735 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:36:51,736 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:36:51,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:36:51,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1163485448, now seen corresponding path program 1 times [2022-03-15 19:36:51,737 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:36:51,737 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413551300] [2022-03-15 19:36:51,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:36:51,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:36:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:51,773 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 19:36:51,774 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:36:51,774 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413551300] [2022-03-15 19:36:51,774 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413551300] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:36:51,774 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:36:51,774 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:36:51,774 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1619332194] [2022-03-15 19:36:51,774 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:36:51,778 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:36:51,830 INFO L252 McrAutomatonBuilder]: Finished intersection with 239 states and 624 transitions. [2022-03-15 19:36:51,830 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:36:53,720 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:36:53,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 19:36:53,720 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:36:53,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 19:36:53,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:36:53,721 INFO L87 Difference]: Start difference. First operand 2360 states and 10324 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 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:36:53,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:36:53,773 INFO L93 Difference]: Finished difference Result 2586 states and 11007 transitions. [2022-03-15 19:36:53,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 19:36:53,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:36:53,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:36:53,784 INFO L225 Difference]: With dead ends: 2586 [2022-03-15 19:36:53,784 INFO L226 Difference]: Without dead ends: 2586 [2022-03-15 19:36:53,785 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 116 SyntacticMatches, 98 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:36:53,785 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 7 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:36:53,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 5 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:36:53,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2586 states. [2022-03-15 19:36:53,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2586 to 2298. [2022-03-15 19:36:53,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2298 states, 2297 states have (on average 4.393556813234654) internal successors, (10092), 2297 states have internal predecessors, (10092), 0 states have call successors, (0), 0 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:36:53,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2298 states to 2298 states and 10092 transitions. [2022-03-15 19:36:53,852 INFO L78 Accepts]: Start accepts. Automaton has 2298 states and 10092 transitions. Word has length 26 [2022-03-15 19:36:53,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:36:53,852 INFO L470 AbstractCegarLoop]: Abstraction has 2298 states and 10092 transitions. [2022-03-15 19:36:53,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 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:36:53,852 INFO L276 IsEmpty]: Start isEmpty. Operand 2298 states and 10092 transitions. [2022-03-15 19:36:53,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:36:53,859 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:36:53,859 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:36:53,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-15 19:36:53,859 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:36:53,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:36:53,860 INFO L85 PathProgramCache]: Analyzing trace with hash -297773364, now seen corresponding path program 4 times [2022-03-15 19:36:53,860 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:36:53,861 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623212311] [2022-03-15 19:36:53,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:36:53,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:36:53,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:54,418 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:36:54,418 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:36:54,419 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623212311] [2022-03-15 19:36:54,419 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623212311] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:36:54,419 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379152878] [2022-03-15 19:36:54,419 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:36:54,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:54,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:36:54,420 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:36:54,421 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:36:54,515 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:36:54,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:36:54,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-15 19:36:54,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:36:54,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:36:54,759 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-03-15 19:36:54,915 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:36:54,916 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 30 [2022-03-15 19:36:55,013 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:36:55,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:36:55,318 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (= (mod c_~sorted2~0 256) 0)) (.cse0 (= (mod c_~sorted3~0 256) 0))) (and (or .cse0 (forall ((v_ArrVal_660 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_660) c_~A~0.base)) (.cse2 (* c_thread1Thread1of1ForFork1_~i~0 4))) (< (select .cse1 (+ c_~A~0.offset .cse2)) (select .cse1 (+ c_~A~0.offset .cse2 4))))) .cse3) (or (and (not .cse3) (not .cse0)) (forall ((v_ArrVal_660 (Array Int Int))) (not (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_660) c_~A~0.base)) (.cse5 (* c_thread1Thread1of1ForFork1_~i~0 4))) (< (select .cse4 (+ c_~A~0.offset .cse5)) (select .cse4 (+ c_~A~0.offset .cse5 4))))))))) is different from false [2022-03-15 19:36:55,506 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:36:55,507 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 87 [2022-03-15 19:36:55,517 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:36:55,518 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 18 [2022-03-15 19:36:55,600 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:36:55,629 INFO L353 Elim1Store]: treesize reduction 94, result has 8.7 percent of original size [2022-03-15 19:36:55,629 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 34 [2022-03-15 19:36:55,775 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-03-15 19:36:55,776 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379152878] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:36:55,776 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:36:55,776 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 30 [2022-03-15 19:36:55,776 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1862514182] [2022-03-15 19:36:55,776 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:36:55,778 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:36:55,797 INFO L252 McrAutomatonBuilder]: Finished intersection with 109 states and 237 transitions. [2022-03-15 19:36:55,798 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:01,002 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [50301#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (= ~sorted3~0 1) (= |thread2Thread1of1ForFork2_#t~mem6| (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset))) (= thread2Thread1of1ForFork2_~i~1 0)), 50300#(and (<= (div ~sorted2~0 256) 0) (= ~A~0.offset 0) (or (<= 1 ~sorted2~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (= ~sorted3~0 1) (or (= ~sorted2~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))))), 50302#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~sorted3~0 1))] [2022-03-15 19:37:01,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:37:01,002 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:01,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:37:01,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=967, Unknown=2, NotChecked=64, Total=1190 [2022-03-15 19:37:01,003 INFO L87 Difference]: Start difference. First operand 2298 states and 10092 transitions. Second operand has 17 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 0 states have call successors, (0), 0 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:37:02,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:02,232 INFO L93 Difference]: Finished difference Result 5053 states and 22483 transitions. [2022-03-15 19:37:02,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 19:37:02,233 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:37:02,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:02,255 INFO L225 Difference]: With dead ends: 5053 [2022-03-15 19:37:02,255 INFO L226 Difference]: Without dead ends: 5040 [2022-03-15 19:37:02,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 47 SyntacticMatches, 62 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1936 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=350, Invalid=1908, Unknown=2, NotChecked=92, Total=2352 [2022-03-15 19:37:02,256 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 226 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:02,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [226 Valid, 119 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:37:02,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5040 states. [2022-03-15 19:37:02,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5040 to 2308. [2022-03-15 19:37:02,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2308 states, 2307 states have (on average 4.386649328131773) internal successors, (10120), 2307 states have internal predecessors, (10120), 0 states have call successors, (0), 0 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:37:02,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 2308 states and 10120 transitions. [2022-03-15 19:37:02,352 INFO L78 Accepts]: Start accepts. Automaton has 2308 states and 10120 transitions. Word has length 26 [2022-03-15 19:37:02,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:02,353 INFO L470 AbstractCegarLoop]: Abstraction has 2308 states and 10120 transitions. [2022-03-15 19:37:02,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 0 states have call successors, (0), 0 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:37:02,353 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 10120 transitions. [2022-03-15 19:37:02,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:37:02,359 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:02,359 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:02,381 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:37:02,575 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,SelfDestructingSolverStorable15 [2022-03-15 19:37:02,575 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:37:02,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:02,576 INFO L85 PathProgramCache]: Analyzing trace with hash -593040628, now seen corresponding path program 5 times [2022-03-15 19:37:02,577 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:02,577 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601676456] [2022-03-15 19:37:02,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:02,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:03,066 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:37:03,067 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:03,067 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601676456] [2022-03-15 19:37:03,067 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601676456] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:37:03,067 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714490436] [2022-03-15 19:37:03,067 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:37:03,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:03,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:37:03,068 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:37:03,069 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:37:03,163 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:37:03,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:37:03,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-15 19:37:03,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:37:03,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:37:03,349 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:37:03,552 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:37:03,552 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 30 [2022-03-15 19:37:03,681 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:37:03,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:04,116 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_709 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_709) c_~A~0.base))) (or (not (< |c_thread2Thread1of1ForFork2_#t~mem6| (select .cse0 (+ c_~A~0.offset 4 (* c_thread2Thread1of1ForFork2_~i~1 4))))) (let ((.cse2 (let ((.cse3 (* c_thread1Thread1of1ForFork1_~i~0 4))) (< (select .cse0 (+ c_~A~0.offset .cse3)) (select .cse0 (+ c_~A~0.offset .cse3 4))))) (.cse1 (= (mod c_~sorted3~0 256) 0))) (and (or .cse1 .cse2) (or (not .cse2) (not .cse1))))))) (forall ((v_ArrVal_709 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_709) c_~A~0.base))) (or (not (let ((.cse5 (* c_thread1Thread1of1ForFork1_~i~0 4))) (< (select .cse4 (+ c_~A~0.offset .cse5)) (select .cse4 (+ c_~A~0.offset .cse5 4))))) (< |c_thread2Thread1of1ForFork2_#t~mem6| (select .cse4 (+ c_~A~0.offset 4 (* c_thread2Thread1of1ForFork2_~i~1 4)))))))) is different from false [2022-03-15 19:37:04,160 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:37:04,161 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 158 treesize of output 151 [2022-03-15 19:37:04,180 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:37:04,181 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 92 [2022-03-15 19:37:04,497 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:37:04,501 INFO L353 Elim1Store]: treesize reduction 102, result has 1.0 percent of original size [2022-03-15 19:37:04,502 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 1 [2022-03-15 19:37:04,627 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:37:04,627 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714490436] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:37:04,627 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:37:04,627 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 28 [2022-03-15 19:37:04,627 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1621552961] [2022-03-15 19:37:04,627 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:04,630 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:04,656 INFO L252 McrAutomatonBuilder]: Finished intersection with 146 states and 348 transitions. [2022-03-15 19:37:04,656 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:14,311 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [60182#(and (or (<= (div ~sorted2~0 256) 0) (= (mod ~sorted1~0 256) 0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (or (= (mod ~sorted1~0 256) 0) (not (<= (+ (div ~sorted2~0 256) 1) 0))) (or (<= 1 ~sorted2~0) (= (mod ~sorted1~0 256) 0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (or (= ~A~0.offset 0) (= (mod ~sorted1~0 256) 0)) (or (<= ~sorted2~0 (* (div ~sorted2~0 256) 256)) (= (mod ~sorted1~0 256) 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (or (= (+ (- 1) ~sorted3~0) 0) (= (mod ~sorted1~0 256) 0))), 60184#(and (= ~A~0.offset 0) (= |thread2Thread1of1ForFork2_#t~mem6| (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~sorted3~0 1) (= ~sorted1~0 1) (= thread2Thread1of1ForFork2_~i~1 0)), 60185#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (= ~sorted3~0 1) (= ~sorted1~0 1) (= |thread2Thread1of1ForFork2_#t~mem6| (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset))) (= thread2Thread1of1ForFork2_~i~1 0)), 60180#(and (< 0 (+ (div ~sorted1~0 256) 1)) (or (<= ~sorted1~0 (* (div ~sorted1~0 256) 256)) (< |thread2Thread1of1ForFork2_#t~mem6| (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset 4)))) (<= ~sorted1~0 (+ (* (div ~sorted1~0 256) 256) 1)) (<= (div ~sorted1~0 256) 0) (= ~sorted3~0 1) (or (<= 1 ~sorted1~0) (not (< |thread2Thread1of1ForFork2_#t~mem6| (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset 4)))))), 60181#(and (or (= (mod ~sorted1~0 256) 0) (= thread1Thread1of1ForFork1_~i~0 0)) (or (<= ~sorted2~0 (* (div ~sorted2~0 256) 256)) (= (mod ~sorted1~0 256) 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))))) (or (<= (div ~sorted2~0 256) 0) (= (mod ~sorted1~0 256) 0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (= (mod ~sorted1~0 256) 0) (not (<= (+ (div ~sorted2~0 256) 1) 0))) (or (<= 1 ~sorted2~0) (= (mod ~sorted1~0 256) 0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (= ~A~0.offset 0) (= (mod ~sorted1~0 256) 0)) (or (= (+ (- 1) ~sorted3~0) 0) (= (mod ~sorted1~0 256) 0))), 60183#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~sorted3~0 1) (= ~sorted1~0 1))] [2022-03-15 19:37:14,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:37:14,311 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:14,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:37:14,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1057, Unknown=1, NotChecked=66, Total=1260 [2022-03-15 19:37:14,312 INFO L87 Difference]: Start difference. First operand 2308 states and 10120 transitions. Second operand has 17 states, 16 states have (on average 4.5625) internal successors, (73), 16 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:37:17,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:17,014 INFO L93 Difference]: Finished difference Result 7104 states and 29759 transitions. [2022-03-15 19:37:17,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 19:37:17,015 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.5625) internal successors, (73), 16 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 26 [2022-03-15 19:37:17,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:17,046 INFO L225 Difference]: With dead ends: 7104 [2022-03-15 19:37:17,047 INFO L226 Difference]: Without dead ends: 7075 [2022-03-15 19:37:17,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 92 SyntacticMatches, 54 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1592 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=481, Invalid=3062, Unknown=1, NotChecked=116, Total=3660 [2022-03-15 19:37:17,048 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 199 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 1594 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 1652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:17,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 167 Invalid, 1652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1594 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 19:37:17,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7075 states. [2022-03-15 19:37:17,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7075 to 2555. [2022-03-15 19:37:17,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2555 states, 2554 states have (on average 4.484729835552075) internal successors, (11454), 2554 states have internal predecessors, (11454), 0 states have call successors, (0), 0 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:37:17,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2555 states and 11454 transitions. [2022-03-15 19:37:17,166 INFO L78 Accepts]: Start accepts. Automaton has 2555 states and 11454 transitions. Word has length 26 [2022-03-15 19:37:17,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:17,166 INFO L470 AbstractCegarLoop]: Abstraction has 2555 states and 11454 transitions. [2022-03-15 19:37:17,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.5625) internal successors, (73), 16 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:37:17,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 11454 transitions. [2022-03-15 19:37:17,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:37:17,173 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:17,173 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:17,201 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:37:17,395 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,SelfDestructingSolverStorable16 [2022-03-15 19:37:17,395 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:37:17,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:17,396 INFO L85 PathProgramCache]: Analyzing trace with hash 197136004, now seen corresponding path program 6 times [2022-03-15 19:37:17,397 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:17,397 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855562412] [2022-03-15 19:37:17,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:17,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:17,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:17,823 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:37:17,823 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:17,823 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855562412] [2022-03-15 19:37:17,824 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855562412] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:37:17,824 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494552786] [2022-03-15 19:37:17,824 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:37:17,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:17,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:37:17,828 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:37:17,832 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:37:17,965 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:37:17,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:37:17,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-15 19:37:17,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:37:18,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:37:18,241 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2022-03-15 19:37:18,291 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:37:18,292 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 30 [2022-03-15 19:37:18,418 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:37:18,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:18,966 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:37:18,967 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 87 [2022-03-15 19:37:18,971 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2022-03-15 19:37:19,055 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:37:19,062 INFO L353 Elim1Store]: treesize reduction 102, result has 1.0 percent of original size [2022-03-15 19:37:19,062 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 1 [2022-03-15 19:37:19,176 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:37:19,176 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494552786] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:37:19,176 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:37:19,176 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-03-15 19:37:19,176 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [705771118] [2022-03-15 19:37:19,177 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:19,179 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:19,195 INFO L252 McrAutomatonBuilder]: Finished intersection with 95 states and 192 transitions. [2022-03-15 19:37:19,195 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:25,695 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [72630#(and (< 0 (+ (div ~sorted1~0 256) 1)) (or (<= ~sorted1~0 (* (div ~sorted1~0 256) 256)) (< |thread2Thread1of1ForFork2_#t~mem6| (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset 4)))) (<= ~sorted1~0 (+ (* (div ~sorted1~0 256) 256) 1)) (<= (div ~sorted1~0 256) 0) (= ~sorted3~0 1) (or (<= 1 ~sorted1~0) (not (< |thread2Thread1of1ForFork2_#t~mem6| (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset 4)))))), 72633#(and (or (= (+ (- 1) ~sorted3~0) 0) (= (mod ~sorted2~0 256) 0)) (or (= (mod ~sorted2~0 256) 0) (= thread1Thread1of1ForFork1_~i~0 0)) (or (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (mod ~sorted2~0 256) 0)) (or (= (mod ~sorted2~0 256) 0) (= thread2Thread1of1ForFork2_~i~1 0)) (or (= ~A~0.offset 0) (= (mod ~sorted2~0 256) 0)) (or (= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) |thread1Thread1of1ForFork1_#t~mem2|) (= (mod ~sorted2~0 256) 0))), 72635#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~sorted3~0 1)), 72631#(and (or (= (+ (- 1) ~sorted3~0) 0) (= (mod ~sorted2~0 256) 0)) (or (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (mod ~sorted2~0 256) 0)) (or (= (mod ~sorted2~0 256) 0) (= thread2Thread1of1ForFork2_~i~1 0)) (or (not (<= (+ (div ~sorted1~0 256) 1) 0)) (= (mod ~sorted2~0 256) 0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset))) (= (mod ~sorted2~0 256) 0) (<= 1 ~sorted1~0)) (or (= ~A~0.offset 0) (= (mod ~sorted2~0 256) 0)) (or (<= ~sorted1~0 0) (= (mod ~sorted2~0 256) 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset 4)))) (or (<= ~sorted1~0 1) (= (mod ~sorted2~0 256) 0))), 72632#(and (or (= (+ (- 1) ~sorted3~0) 0) (= (mod ~sorted2~0 256) 0)) (or (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (mod ~sorted2~0 256) 0)) (or (not (<= (+ (div ~sorted1~0 256) 1) 0)) (= (mod ~sorted2~0 256) 0)) (or (<= ~sorted1~0 0) (= (mod ~sorted2~0 256) 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (or (= (mod ~sorted2~0 256) 0) (<= 1 ~sorted1~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (or (= ~A~0.offset 0) (= (mod ~sorted2~0 256) 0)) (or (<= ~sorted1~0 1) (= (mod ~sorted2~0 256) 0))), 72629#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (= |thread2Thread1of1ForFork2_#t~mem6| (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~sorted3~0 1) (= thread2Thread1of1ForFork2_~i~1 0)), 72634#(and (or (= (+ (- 1) ~sorted3~0) 0) (= (mod ~sorted2~0 256) 0)) (or (= (mod ~sorted2~0 256) 0) (= thread1Thread1of1ForFork1_~i~0 0)) (or (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (mod ~sorted2~0 256) 0)) (or (= ~A~0.offset 0) (= (mod ~sorted2~0 256) 0)) (or (= (mod ~sorted2~0 256) 0) (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) ~A~0.offset))))] [2022-03-15 19:37:25,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:37:25,696 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:25,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:37:25,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1067, Unknown=6, NotChecked=0, Total=1260 [2022-03-15 19:37:25,697 INFO L87 Difference]: Start difference. First operand 2555 states and 11454 transitions. Second operand has 18 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:29,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:29,061 INFO L93 Difference]: Finished difference Result 8992 states and 38374 transitions. [2022-03-15 19:37:29,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 19:37:29,062 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:37:29,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:29,098 INFO L225 Difference]: With dead ends: 8992 [2022-03-15 19:37:29,098 INFO L226 Difference]: Without dead ends: 8933 [2022-03-15 19:37:29,099 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 56 SyntacticMatches, 37 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2217 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=821, Invalid=3729, Unknown=6, NotChecked=0, Total=4556 [2022-03-15 19:37:29,099 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 405 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 1861 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 1965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:29,099 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [405 Valid, 192 Invalid, 1965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1861 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 19:37:29,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8933 states. [2022-03-15 19:37:29,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8933 to 3323. [2022-03-15 19:37:29,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3323 states, 3322 states have (on average 4.695063214930765) internal successors, (15597), 3322 states have internal predecessors, (15597), 0 states have call successors, (0), 0 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:37:29,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3323 states to 3323 states and 15597 transitions. [2022-03-15 19:37:29,268 INFO L78 Accepts]: Start accepts. Automaton has 3323 states and 15597 transitions. Word has length 26 [2022-03-15 19:37:29,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:29,268 INFO L470 AbstractCegarLoop]: Abstraction has 3323 states and 15597 transitions. [2022-03-15 19:37:29,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:29,268 INFO L276 IsEmpty]: Start isEmpty. Operand 3323 states and 15597 transitions. [2022-03-15 19:37:29,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:37:29,278 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:29,278 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:29,296 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:37:29,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:29,483 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:37:29,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:29,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1847191034, now seen corresponding path program 7 times [2022-03-15 19:37:29,484 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:29,484 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576156109] [2022-03-15 19:37:29,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:29,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:30,005 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:37:30,006 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:30,006 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576156109] [2022-03-15 19:37:30,006 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576156109] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:37:30,006 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334735304] [2022-03-15 19:37:30,006 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:37:30,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:30,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:37:30,007 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:37:30,008 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:37:30,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:30,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 44 conjunts are in the unsatisfiable core [2022-03-15 19:37:30,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:37:30,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:37:30,516 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2022-03-15 19:37:30,634 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:37:30,635 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 30 [2022-03-15 19:37:30,729 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:37:30,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:30,981 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= (mod c_~sorted2~0 256) 0)) (.cse0 (= (mod c_~sorted3~0 256) 0))) (and (or .cse0 (forall ((v_ArrVal_807 (Array Int Int))) (< |c_thread1Thread1of1ForFork1_#t~mem2| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4) 4)))) .cse1) (or (and (not .cse1) (not .cse0)) (forall ((v_ArrVal_807 (Array Int Int))) (not (< |c_thread1Thread1of1ForFork1_#t~mem2| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4) 4)))))))) is different from false [2022-03-15 19:37:31,108 WARN L838 $PredicateComparison]: unable to prove that (or (let ((.cse1 (forall ((v_ArrVal_807 (Array Int Int))) (not (< |c_thread1Thread1of1ForFork1_#t~mem2| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4) 4)))))) (.cse2 (let ((.cse3 (select |c_#memory_int| c_~A~0.base)) (.cse4 (* c_thread2Thread1of1ForFork2_~i~1 4))) (< (select .cse3 (+ c_~A~0.offset .cse4)) (select .cse3 (+ c_~A~0.offset 4 .cse4)))))) (and (or (let ((.cse0 (= (mod c_~sorted3~0 256) 0))) (and (or .cse0 (forall ((v_ArrVal_807 (Array Int Int))) (< |c_thread1Thread1of1ForFork1_#t~mem2| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4) 4))))) (or (not .cse0) .cse1))) (not .cse2)) (or .cse1 .cse2))) (= (mod c_~sorted2~0 256) 0)) is different from false [2022-03-15 19:37:31,149 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:37:31,149 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 81 [2022-03-15 19:37:31,154 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2022-03-15 19:37:31,260 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:37:31,274 INFO L353 Elim1Store]: treesize reduction 94, result has 8.7 percent of original size [2022-03-15 19:37:31,274 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 34 [2022-03-15 19:37:31,413 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-03-15 19:37:31,413 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334735304] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:37:31,414 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:37:31,414 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 30 [2022-03-15 19:37:31,414 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [42293791] [2022-03-15 19:37:31,414 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:31,417 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:31,435 INFO L252 McrAutomatonBuilder]: Finished intersection with 87 states and 172 transitions. [2022-03-15 19:37:31,435 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:38,635 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [88520#(and (or (= (mod ~sorted1~0 256) 0) (= thread1Thread1of1ForFork1_~i~0 0)) (or (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (mod ~sorted1~0 256) 0)) (or (= (mod ~sorted1~0 256) 0) (not (<= (+ (div ~sorted2~0 256) 1) 0))) (or (<= 1 ~sorted2~0) (= (mod ~sorted1~0 256) 0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (= (mod ~sorted1~0 256) 0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~sorted2~0 0)) (or (<= (div ~sorted2~0 256) 0) (= (mod ~sorted1~0 256) 0)) (or (= ~A~0.offset 0) (= (mod ~sorted1~0 256) 0)) (or (= (+ (- 1) ~sorted3~0) 0) (= (mod ~sorted1~0 256) 0))), 88521#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 0) (= ~sorted3~0 1)), 88523#(and (or (= (mod ~sorted1~0 256) 0) (= thread2Thread1of1ForFork2_~i~1 0)) (or (= (mod ~sorted1~0 256) 0) (= thread1Thread1of1ForFork1_~i~0 0)) (or (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (mod ~sorted1~0 256) 0)) (or (= (mod ~sorted1~0 256) 0) (= |thread2Thread1of1ForFork2_#t~mem6| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (= ~A~0.offset 0) (= (mod ~sorted1~0 256) 0)) (or (= (+ (- 1) ~sorted3~0) 0) (= (mod ~sorted1~0 256) 0))), 88525#(and (or (= (mod ~sorted1~0 256) 0) (= thread2Thread1of1ForFork2_~i~1 0)) (or (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (mod ~sorted1~0 256) 0)) (or (= (mod ~sorted1~0 256) 0) (= |thread2Thread1of1ForFork2_#t~mem6| (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (or (= ~A~0.offset 0) (= (mod ~sorted1~0 256) 0)) (or (= (+ (- 1) ~sorted3~0) 0) (= (mod ~sorted1~0 256) 0))), 88522#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~sorted3~0 1)), 88524#(and (or (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (mod ~sorted1~0 256) 0)) (or (= (mod ~sorted1~0 256) 0) (not (<= (+ (div ~sorted2~0 256) 1) 0))) (or (<= 1 ~sorted2~0) (= (mod ~sorted1~0 256) 0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (or (<= (div ~sorted2~0 256) 0) (= (mod ~sorted1~0 256) 0)) (or (= ~A~0.offset 0) (= (mod ~sorted1~0 256) 0)) (or (= (mod ~sorted1~0 256) 0) (<= ~sorted2~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (or (= (+ (- 1) ~sorted3~0) 0) (= (mod ~sorted1~0 256) 0)))] [2022-03-15 19:37:38,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:37:38,635 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:38,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:37:38,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1074, Unknown=4, NotChecked=138, Total=1406 [2022-03-15 19:37:38,636 INFO L87 Difference]: Start difference. First operand 3323 states and 15597 transitions. Second operand has 19 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:45,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:45,376 INFO L93 Difference]: Finished difference Result 13641 states and 61342 transitions. [2022-03-15 19:37:45,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-03-15 19:37:45,377 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:37:45,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:45,433 INFO L225 Difference]: With dead ends: 13641 [2022-03-15 19:37:45,433 INFO L226 Difference]: Without dead ends: 13586 [2022-03-15 19:37:45,434 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 36 SyntacticMatches, 49 SemanticMatches, 92 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3872 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1266, Invalid=7110, Unknown=4, NotChecked=362, Total=8742 [2022-03-15 19:37:45,435 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 660 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 2924 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 3115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 2924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:45,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [660 Valid, 280 Invalid, 3115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 2924 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 19:37:45,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13586 states. [2022-03-15 19:37:45,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13586 to 4120. [2022-03-15 19:37:45,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4120 states, 4119 states have (on average 4.883709638261714) internal successors, (20116), 4119 states have internal predecessors, (20116), 0 states have call successors, (0), 0 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:37:45,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4120 states to 4120 states and 20116 transitions. [2022-03-15 19:37:45,691 INFO L78 Accepts]: Start accepts. Automaton has 4120 states and 20116 transitions. Word has length 26 [2022-03-15 19:37:45,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:45,691 INFO L470 AbstractCegarLoop]: Abstraction has 4120 states and 20116 transitions. [2022-03-15 19:37:45,691 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:45,692 INFO L276 IsEmpty]: Start isEmpty. Operand 4120 states and 20116 transitions. [2022-03-15 19:37:45,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:37:45,713 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:45,713 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:45,740 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:37:45,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:45,936 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:37:45,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:45,936 INFO L85 PathProgramCache]: Analyzing trace with hash 109394240, now seen corresponding path program 8 times [2022-03-15 19:37:45,937 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:45,937 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731104600] [2022-03-15 19:37:45,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:45,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:46,627 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:37:46,627 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:46,627 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731104600] [2022-03-15 19:37:46,628 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731104600] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:37:46,628 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835218027] [2022-03-15 19:37:46,628 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:37:46,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:46,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:37:46,629 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:37:46,634 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:37:46,750 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:37:46,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:37:46,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-15 19:37:46,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:37:46,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:37:46,901 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:37:47,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:37:47,098 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2022-03-15 19:37:47,217 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:37:47,217 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 30 [2022-03-15 19:37:47,313 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:37:47,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:47,567 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= (mod c_~sorted2~0 256) 0)) (.cse0 (= (mod c_~sorted3~0 256) 0))) (and (or .cse0 (forall ((v_ArrVal_857 (Array Int Int))) (< |c_thread1Thread1of1ForFork1_#t~mem2| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_857) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4) 4)))) .cse1) (or (forall ((v_ArrVal_857 (Array Int Int))) (not (< |c_thread1Thread1of1ForFork1_#t~mem2| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_857) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4) 4))))) (and (not .cse1) (not .cse0))))) is different from false [2022-03-15 19:37:47,714 WARN L838 $PredicateComparison]: unable to prove that (or (let ((.cse0 (forall ((v_ArrVal_857 (Array Int Int))) (not (< |c_thread1Thread1of1ForFork1_#t~mem2| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_857) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4) 4)))))) (.cse1 (let ((.cse3 (select |c_#memory_int| c_~A~0.base)) (.cse4 (* c_thread2Thread1of1ForFork2_~i~1 4))) (< (select .cse3 (+ c_~A~0.offset .cse4)) (select .cse3 (+ c_~A~0.offset 4 .cse4)))))) (and (or .cse0 .cse1) (or (let ((.cse2 (= (mod c_~sorted3~0 256) 0))) (and (or .cse2 (forall ((v_ArrVal_857 (Array Int Int))) (< |c_thread1Thread1of1ForFork1_#t~mem2| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_857) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4) 4))))) (or .cse0 (not .cse2)))) (not .cse1)))) (= (mod c_~sorted2~0 256) 0)) is different from false [2022-03-15 19:37:47,736 WARN L838 $PredicateComparison]: unable to prove that (or (let ((.cse2 (forall ((v_ArrVal_857 (Array Int Int))) (not (< |c_thread1Thread1of1ForFork1_#t~mem2| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_857) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4) 4)))))) (.cse0 (let ((.cse3 (select |c_#memory_int| c_~A~0.base))) (< (select .cse3 c_~A~0.offset) (select .cse3 (+ c_~A~0.offset 4)))))) (and (or (not .cse0) (let ((.cse1 (= (mod c_~sorted3~0 256) 0))) (and (or .cse1 (forall ((v_ArrVal_857 (Array Int Int))) (< |c_thread1Thread1of1ForFork1_#t~mem2| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_857) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4) 4))))) (or .cse2 (not .cse1))))) (or .cse2 .cse0))) (= (mod c_~sorted2~0 256) 0)) is different from false [2022-03-15 19:37:47,798 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_856 (Array Int Int))) (or (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_856) c_~A~0.base))) (< (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 4)))) (forall ((v_ArrVal_857 (Array Int Int))) (not (< |c_thread1Thread1of1ForFork1_#t~mem2| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_856) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_857) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4) 4))))))) (forall ((v_ArrVal_856 (Array Int Int))) (or (not (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_856) c_~A~0.base))) (< (select .cse1 c_~A~0.offset) (select .cse1 (+ c_~A~0.offset 4))))) (let ((.cse2 (= (mod c_~sorted3~0 256) 0))) (and (or (forall ((v_ArrVal_857 (Array Int Int))) (not (< |c_thread1Thread1of1ForFork1_#t~mem2| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_856) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_857) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4) 4))))) (not .cse2)) (or .cse2 (forall ((v_ArrVal_857 (Array Int Int))) (< |c_thread1Thread1of1ForFork1_#t~mem2| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_856) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_857) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4) 4)))))))))) (= (mod c_~sorted2~0 256) 0)) is different from false [2022-03-15 19:37:47,841 INFO L353 Elim1Store]: treesize reduction 39, result has 52.4 percent of original size [2022-03-15 19:37:47,841 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 260 treesize of output 210 [2022-03-15 19:37:47,848 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 129 [2022-03-15 19:37:47,855 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 115 [2022-03-15 19:37:47,879 INFO L353 Elim1Store]: treesize reduction 16, result has 59.0 percent of original size [2022-03-15 19:37:47,879 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 140 treesize of output 142 [2022-03-15 19:37:48,175 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:37:48,175 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:37:48,180 INFO L353 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2022-03-15 19:37:48,180 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 1 [2022-03-15 19:37:48,278 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-03-15 19:37:48,278 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835218027] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:37:48,278 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:37:48,278 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 32 [2022-03-15 19:37:48,278 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1979476757] [2022-03-15 19:37:48,279 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:48,281 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:48,292 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 150 transitions. [2022-03-15 19:37:48,293 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:53,210 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:37:53,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 19:37:53,210 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:53,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 19:37:53,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=768, Unknown=5, NotChecked=236, Total=1122 [2022-03-15 19:37:53,210 INFO L87 Difference]: Start difference. First operand 4120 states and 20116 transitions. Second operand has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 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:37:54,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:54,117 INFO L93 Difference]: Finished difference Result 6393 states and 30161 transitions. [2022-03-15 19:37:54,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 19:37:54,117 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:37:54,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:54,136 INFO L225 Difference]: With dead ends: 6393 [2022-03-15 19:37:54,137 INFO L226 Difference]: Without dead ends: 6382 [2022-03-15 19:37:54,137 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 30 SyntacticMatches, 49 SemanticMatches, 43 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1194 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=270, Invalid=1381, Unknown=5, NotChecked=324, Total=1980 [2022-03-15 19:37:54,137 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 160 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:54,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 66 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:37:54,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6382 states. [2022-03-15 19:37:54,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6382 to 4296. [2022-03-15 19:37:54,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4296 states, 4295 states have (on average 4.911757857974389) internal successors, (21096), 4295 states have internal predecessors, (21096), 0 states have call successors, (0), 0 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:37:54,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4296 states to 4296 states and 21096 transitions. [2022-03-15 19:37:54,289 INFO L78 Accepts]: Start accepts. Automaton has 4296 states and 21096 transitions. Word has length 26 [2022-03-15 19:37:54,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:54,289 INFO L470 AbstractCegarLoop]: Abstraction has 4296 states and 21096 transitions. [2022-03-15 19:37:54,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 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:37:54,290 INFO L276 IsEmpty]: Start isEmpty. Operand 4296 states and 21096 transitions. [2022-03-15 19:37:54,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:37:54,303 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:54,303 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:54,331 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:37:54,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:54,529 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:37:54,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:54,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1875300932, now seen corresponding path program 9 times [2022-03-15 19:37:54,530 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:54,530 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590910182] [2022-03-15 19:37:54,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:54,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:54,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:55,154 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:37:55,155 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:55,155 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590910182] [2022-03-15 19:37:55,155 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590910182] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:37:55,155 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215699961] [2022-03-15 19:37:55,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:37:55,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:55,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:37:55,160 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:37:55,186 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:37:55,368 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:37:55,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:37:55,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-15 19:37:55,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:37:55,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:37:55,482 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:37:55,552 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:37:55,553 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:37:55,553 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-03-15 19:37:55,674 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 30 [2022-03-15 19:37:55,777 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:37:55,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:56,002 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:37:56,002 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 71 [2022-03-15 19:37:56,232 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_906 (Array Int Int))) (<= |c_thread1Thread1of1ForFork1_#t~mem2| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_906) c_~A~0.base) c_~A~0.offset))) (not (= (mod c_~sorted3~0 256) 0)) (forall ((v_ArrVal_906 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_906) c_~A~0.base) c_~A~0.offset) |c_thread1Thread1of1ForFork1_#t~mem2|)) (= (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4) 4) (+ c_~A~0.offset 4))) (= (mod c_~sorted2~0 256) 0)) is different from false [2022-03-15 19:37:56,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:37:56,246 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:37:56,246 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 22 [2022-03-15 19:37:56,249 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:37:56,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:37:56,252 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-03-15 19:37:56,331 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:37:56,331 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215699961] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:37:56,331 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:37:56,331 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 29 [2022-03-15 19:37:56,331 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1741266864] [2022-03-15 19:37:56,332 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:56,335 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:56,384 INFO L252 McrAutomatonBuilder]: Finished intersection with 101 states and 222 transitions. [2022-03-15 19:37:56,384 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:38:00,945 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [125891#(and (< 0 (+ (div ~sorted1~0 256) 1)) (or (= ~sorted1~0 (* (div ~sorted1~0 256) 256)) (< |thread2Thread1of1ForFork2_#t~mem6| (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset 4)))) (or (= (+ ~sorted1~0 (* (div ~sorted1~0 256) (- 256))) 1) (not (< |thread2Thread1of1ForFork2_#t~mem6| (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset 4))))) (= ~sorted3~0 1)), 125892#(and (or (not (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))))) (not (= (+ (* (- 256) (div ~sorted2~0 256)) ~sorted2~0) 0))) (or (= (* (div ~sorted2~0 256) 256) ~sorted2~0) (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))))) (= ~sorted3~0 1))] [2022-03-15 19:38:00,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:38:00,945 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:38:00,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:38:00,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=873, Unknown=1, NotChecked=60, Total=1056 [2022-03-15 19:38:00,946 INFO L87 Difference]: Start difference. First operand 4296 states and 21096 transitions. Second operand has 15 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:01,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:38:01,847 INFO L93 Difference]: Finished difference Result 6870 states and 33750 transitions. [2022-03-15 19:38:01,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 19:38:01,847 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:38:01,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:38:01,869 INFO L225 Difference]: With dead ends: 6870 [2022-03-15 19:38:01,869 INFO L226 Difference]: Without dead ends: 6861 [2022-03-15 19:38:01,870 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 58 SyntacticMatches, 47 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=258, Invalid=1467, Unknown=1, NotChecked=80, Total=1806 [2022-03-15 19:38:01,870 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 152 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:38:01,870 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 80 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 873 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:38:01,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6861 states. [2022-03-15 19:38:01,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6861 to 4334. [2022-03-15 19:38:01,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4334 states, 4333 states have (on average 4.927071313177937) internal successors, (21349), 4333 states have internal predecessors, (21349), 0 states have call successors, (0), 0 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:38:01,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4334 states to 4334 states and 21349 transitions. [2022-03-15 19:38:01,996 INFO L78 Accepts]: Start accepts. Automaton has 4334 states and 21349 transitions. Word has length 26 [2022-03-15 19:38:01,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:38:01,996 INFO L470 AbstractCegarLoop]: Abstraction has 4334 states and 21349 transitions. [2022-03-15 19:38:01,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:01,996 INFO L276 IsEmpty]: Start isEmpty. Operand 4334 states and 21349 transitions. [2022-03-15 19:38:02,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:38:02,009 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:38:02,009 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:38:02,036 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:38:02,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:02,233 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:38:02,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:38:02,234 INFO L85 PathProgramCache]: Analyzing trace with hash -2071024994, now seen corresponding path program 10 times [2022-03-15 19:38:02,234 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:38:02,235 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344639619] [2022-03-15 19:38:02,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:38:02,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:38:02,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:38:02,903 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:38:02,903 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:38:02,903 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344639619] [2022-03-15 19:38:02,904 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344639619] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:38:02,904 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929777513] [2022-03-15 19:38:02,904 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:38:02,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:02,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:38:02,905 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:38:02,905 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:38:03,110 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:38:03,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:38:03,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-15 19:38:03,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:38:03,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:38:03,248 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:38:03,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:38:03,327 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:38:03,489 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:38:03,489 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 30 [2022-03-15 19:38:03,629 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:38:03,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:38:04,062 WARN L838 $PredicateComparison]: unable to prove that (or (and (or (forall ((v_ArrVal_956 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_956) c_~A~0.base))) (or (< |c_thread1Thread1of1ForFork1_#t~mem2| (select .cse0 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4) 4))) (not (let ((.cse1 (* c_thread2Thread1of1ForFork2_~i~1 4))) (< (select .cse0 (+ c_~A~0.offset .cse1)) (select .cse0 (+ c_~A~0.offset 4 .cse1)))))))) (= (mod c_~sorted3~0 256) 0)) (forall ((v_ArrVal_956 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_956) c_~A~0.base))) (or (not (< |c_thread1Thread1of1ForFork1_#t~mem2| (select .cse2 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4) 4)))) (and (let ((.cse3 (* c_thread2Thread1of1ForFork2_~i~1 4))) (< (select .cse2 (+ c_~A~0.offset .cse3)) (select .cse2 (+ c_~A~0.offset 4 .cse3)))) (not (= (mod c_~sorted3~0 256) 0))))))) (= (mod c_~sorted2~0 256) 0)) is different from false [2022-03-15 19:38:04,089 WARN L838 $PredicateComparison]: unable to prove that (or (= (mod c_~sorted2~0 256) 0) (and (or (= (mod c_~sorted3~0 256) 0) (forall ((v_ArrVal_956 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_956) c_~A~0.base))) (or (< |c_thread1Thread1of1ForFork1_#t~mem2| (select .cse0 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4) 4))) (not (< (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 4)))))))) (forall ((v_ArrVal_956 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_956) c_~A~0.base))) (or (not (< |c_thread1Thread1of1ForFork1_#t~mem2| (select .cse1 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4) 4)))) (and (< (select .cse1 c_~A~0.offset) (select .cse1 (+ c_~A~0.offset 4))) (not (= (mod c_~sorted3~0 256) 0)))))))) is different from false [2022-03-15 19:38:04,147 WARN L838 $PredicateComparison]: unable to prove that (or (= (mod c_~sorted2~0 256) 0) (and (or (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_955) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_956) c_~A~0.base))) (or (< |c_thread1Thread1of1ForFork1_#t~mem2| (select .cse0 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4) 4))) (not (< (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 4))))))) (= (mod c_~sorted3~0 256) 0)) (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_955) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_956) c_~A~0.base))) (or (and (< (select .cse1 c_~A~0.offset) (select .cse1 (+ c_~A~0.offset 4))) (not (= (mod c_~sorted3~0 256) 0))) (not (< |c_thread1Thread1of1ForFork1_#t~mem2| (select .cse1 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4) 4))))))))) is different from false [2022-03-15 19:38:04,202 INFO L353 Elim1Store]: treesize reduction 39, result has 52.4 percent of original size [2022-03-15 19:38:04,203 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 376 treesize of output 316 [2022-03-15 19:38:04,228 INFO L353 Elim1Store]: treesize reduction 16, result has 59.0 percent of original size [2022-03-15 19:38:04,228 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 274 treesize of output 244 [2022-03-15 19:38:04,254 INFO L353 Elim1Store]: treesize reduction 16, result has 59.0 percent of original size [2022-03-15 19:38:04,254 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 222 treesize of output 218 [2022-03-15 19:38:04,883 INFO L353 Elim1Store]: treesize reduction 39, result has 52.4 percent of original size [2022-03-15 19:38:04,884 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 384 treesize of output 324 [2022-03-15 19:38:04,905 INFO L353 Elim1Store]: treesize reduction 16, result has 59.0 percent of original size [2022-03-15 19:38:04,905 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 282 treesize of output 252 [2022-03-15 19:38:04,926 INFO L353 Elim1Store]: treesize reduction 16, result has 59.0 percent of original size [2022-03-15 19:38:04,926 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 230 treesize of output 226 [2022-03-15 19:38:05,705 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:38:05,706 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929777513] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:38:05,706 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:38:05,706 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2022-03-15 19:38:05,706 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [886781067] [2022-03-15 19:38:05,706 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:38:05,708 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:38:05,734 INFO L252 McrAutomatonBuilder]: Finished intersection with 154 states and 372 transitions. [2022-03-15 19:38:05,734 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:38:14,289 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [141637#(and (= ~A~0.offset 0) (= ~sorted2~0 1) (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= thread1Thread1of1ForFork1_~i~0 0) (= ~sorted3~0 1)), 141631#(and (< 0 (+ (div ~sorted1~0 256) 1)) (<= ~sorted1~0 1) (or (<= ~sorted1~0 (* (div ~sorted1~0 256) 256)) (< |thread2Thread1of1ForFork2_#t~mem6| (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset 4)))) (= ~sorted3~0 1) (or (<= 1 ~sorted1~0) (not (< |thread2Thread1of1ForFork2_#t~mem6| (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset 4)))))), 141634#(and (or (<= ~sorted2~0 (* (div ~sorted2~0 256) 256)) (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))))) (or (not (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))))) (not (= (* (div ~sorted2~0 256) 256) ~sorted2~0))) (< 0 (+ (div ~sorted2~0 256) 1)) (= ~sorted3~0 1)), 141633#(and (or (< 0 (+ (div ~sorted1~0 256) 1)) (= (mod ~sorted2~0 256) 0)) (or (= (mod ~sorted2~0 256) 0) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= 1 ~sorted1~0)) (or (= (mod ~sorted2~0 256) 0) (= ~sorted3~0 1)) (or (<= ~sorted1~0 (* (div ~sorted1~0 256) 256)) (= (mod ~sorted2~0 256) 0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (or (<= ~sorted1~0 1) (= (mod ~sorted2~0 256) 0))), 141635#(and (= ~A~0.offset 0) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset 4)) |thread2Thread1of1ForFork2_#t~mem6|) (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))))) (or (<= (+ |thread2Thread1of1ForFork2_#t~mem6| 1) (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset 4))) (not (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))))) (= ~sorted3~0 1) (= thread2Thread1of1ForFork2_~i~1 0)), 141636#(and (= ~A~0.offset 0) (< 0 (+ (div ~sorted1~0 256) 1)) (or (<= ~sorted1~0 0) (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (or (<= 1 ~sorted1~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= ~sorted1~0 1) (= ~sorted2~0 1) (= ~sorted3~0 1)), 141632#(and (or (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset 4)))) (= (mod ~sorted2~0 256) 0) (<= 1 ~sorted1~0)) (or (< 0 (+ (div ~sorted1~0 256) 1)) (= (mod ~sorted2~0 256) 0)) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset 4))) (<= ~sorted1~0 (* (div ~sorted1~0 256) 256)) (= (mod ~sorted2~0 256) 0)) (or (= (mod ~sorted2~0 256) 0) (= ~sorted3~0 1)) (or (<= ~sorted1~0 1) (= (mod ~sorted2~0 256) 0)))] [2022-03-15 19:38:14,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:38:14,289 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:38:14,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:38:14,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=999, Unknown=3, NotChecked=198, Total=1332 [2022-03-15 19:38:14,290 INFO L87 Difference]: Start difference. First operand 4334 states and 21349 transitions. Second operand has 19 states, 18 states have (on average 4.833333333333333) internal successors, (87), 18 states have internal predecessors, (87), 0 states have call successors, (0), 0 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:38:17,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:38:17,128 INFO L93 Difference]: Finished difference Result 8953 states and 41463 transitions. [2022-03-15 19:38:17,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 19:38:17,128 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.833333333333333) internal successors, (87), 18 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:38:17,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:38:17,159 INFO L225 Difference]: With dead ends: 8953 [2022-03-15 19:38:17,159 INFO L226 Difference]: Without dead ends: 8926 [2022-03-15 19:38:17,159 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 105 SyntacticMatches, 49 SemanticMatches, 58 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1676 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=430, Invalid=2771, Unknown=3, NotChecked=336, Total=3540 [2022-03-15 19:38:17,160 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 199 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 1853 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 1908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:38:17,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 194 Invalid, 1908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1853 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 19:38:17,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8926 states. [2022-03-15 19:38:17,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8926 to 4440. [2022-03-15 19:38:17,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4440 states, 4439 states have (on average 4.956521739130435) internal successors, (22002), 4439 states have internal predecessors, (22002), 0 states have call successors, (0), 0 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:38:17,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4440 states to 4440 states and 22002 transitions. [2022-03-15 19:38:17,306 INFO L78 Accepts]: Start accepts. Automaton has 4440 states and 22002 transitions. Word has length 26 [2022-03-15 19:38:17,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:38:17,306 INFO L470 AbstractCegarLoop]: Abstraction has 4440 states and 22002 transitions. [2022-03-15 19:38:17,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.833333333333333) internal successors, (87), 18 states have internal predecessors, (87), 0 states have call successors, (0), 0 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:38:17,306 INFO L276 IsEmpty]: Start isEmpty. Operand 4440 states and 22002 transitions. [2022-03-15 19:38:17,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:38:17,316 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:38:17,316 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:38:17,333 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:38:17,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:17,517 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:38:17,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:38:17,517 INFO L85 PathProgramCache]: Analyzing trace with hash -169778061, now seen corresponding path program 1 times [2022-03-15 19:38:17,518 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:38:17,518 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813030840] [2022-03-15 19:38:17,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:38:17,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:38:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:38:17,597 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:38:17,597 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:38:17,597 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813030840] [2022-03-15 19:38:17,597 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813030840] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:38:17,597 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970774808] [2022-03-15 19:38:17,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:38:17,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:17,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:38:17,600 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:38:17,607 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:38:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:38:17,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 19:38:17,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:38:17,917 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:38:17,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:38:17,942 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:38:17,942 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 13 [2022-03-15 19:38:18,043 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:38:18,044 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970774808] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:38:18,044 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:38:18,044 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2022-03-15 19:38:18,044 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1759070065] [2022-03-15 19:38:18,044 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:38:18,047 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:38:18,070 INFO L252 McrAutomatonBuilder]: Finished intersection with 135 states and 307 transitions. [2022-03-15 19:38:18,070 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:38:19,230 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [159698#(< thread2Thread1of1ForFork2_~i~1 ~M~0), 159701#(or (< (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0) (<= ~N~0 (+ ~M~0 1))), 159697#(or (<= ~N~0 (+ ~M~0 1)) (< (+ 2 ~M~0) ~N~0)), 159696#(or (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 159703#(or (<= ~N~0 (+ ~M~0 1)) (<= ~M~0 0) (< 1 ~M~0)), 159699#(or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 159700#(or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= ~N~0 (+ ~M~0 1))), 159695#(< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0), 159702#(or (< (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0) (<= ~N~0 (+ ~M~0 1)) (<= ~M~0 thread2Thread1of1ForFork2_~i~1))] [2022-03-15 19:38:19,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:38:19,231 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:38:19,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:38:19,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=779, Unknown=0, NotChecked=0, Total=930 [2022-03-15 19:38:19,231 INFO L87 Difference]: Start difference. First operand 4440 states and 22002 transitions. Second operand has 19 states, 19 states have (on average 4.631578947368421) internal successors, (88), 18 states have internal predecessors, (88), 0 states have call successors, (0), 0 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:38:19,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:38:19,812 INFO L93 Difference]: Finished difference Result 4677 states and 22733 transitions. [2022-03-15 19:38:19,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 19:38:19,813 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.631578947368421) internal successors, (88), 18 states have internal predecessors, (88), 0 states have call successors, (0), 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:38:19,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:38:19,826 INFO L225 Difference]: With dead ends: 4677 [2022-03-15 19:38:19,826 INFO L226 Difference]: Without dead ends: 4639 [2022-03-15 19:38:19,827 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 138 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=352, Invalid=1454, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 19:38:19,827 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 267 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:38:19,827 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 94 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 974 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:38:19,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4639 states. [2022-03-15 19:38:19,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4639 to 4416. [2022-03-15 19:38:19,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4416 states, 4415 states have (on average 4.946998867497169) internal successors, (21841), 4415 states have internal predecessors, (21841), 0 states have call successors, (0), 0 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:38:19,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4416 states to 4416 states and 21841 transitions. [2022-03-15 19:38:19,928 INFO L78 Accepts]: Start accepts. Automaton has 4416 states and 21841 transitions. Word has length 27 [2022-03-15 19:38:19,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:38:19,928 INFO L470 AbstractCegarLoop]: Abstraction has 4416 states and 21841 transitions. [2022-03-15 19:38:19,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.631578947368421) internal successors, (88), 18 states have internal predecessors, (88), 0 states have call successors, (0), 0 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:38:19,928 INFO L276 IsEmpty]: Start isEmpty. Operand 4416 states and 21841 transitions. [2022-03-15 19:38:19,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:38:19,938 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:38:19,938 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:38:19,955 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:38:20,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:20,139 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:38:20,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:38:20,140 INFO L85 PathProgramCache]: Analyzing trace with hash 262408561, now seen corresponding path program 2 times [2022-03-15 19:38:20,140 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:38:20,140 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529259214] [2022-03-15 19:38:20,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:38:20,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:38:20,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:38:20,215 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:38:20,215 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:38:20,215 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529259214] [2022-03-15 19:38:20,215 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529259214] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:38:20,215 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889825575] [2022-03-15 19:38:20,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:38:20,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:20,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:38:20,217 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:38:20,247 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:38:20,359 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:38:20,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:38:20,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 19:38:20,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:38:20,539 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:38:20,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:38:20,568 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:38:20,568 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 13 [2022-03-15 19:38:20,689 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:38:20,689 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889825575] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:38:20,689 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:38:20,689 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 22 [2022-03-15 19:38:20,690 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1096455654] [2022-03-15 19:38:20,690 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:38:20,693 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:38:20,758 INFO L252 McrAutomatonBuilder]: Finished intersection with 288 states and 772 transitions. [2022-03-15 19:38:20,759 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:38:25,379 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [173415#(< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0), 173432#(<= (+ ~N~0 ~M~0) (+ 2 thread3Thread1of1ForFork0_~i~2)), 173427#(or (<= ~M~0 0) (< 1 ~M~0)), 173422#(or (< (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 173430#(or (<= ~M~0 0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1)) (< 1 ~M~0)), 173420#(< (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0), 173431#(or (<= ~N~0 (+ ~M~0 1)) (<= ~M~0 0) (< 1 ~M~0)), 173416#(or (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 173426#(or (< (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0) (<= ~M~0 thread2Thread1of1ForFork2_~i~1)), 173418#(<= ~N~0 (+ ~M~0 1)), 173423#(or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= ~N~0 (+ ~M~0 1))), 173425#(and (<= (+ ~N~0 thread2Thread1of1ForFork2_~i~1) (+ ~M~0 1)) (= thread2Thread1of1ForFork2_~i~1 0)), 173421#(or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 173428#(or (< (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0) (<= ~M~0 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 173429#(or (< (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0) (<= ~N~0 (+ ~M~0 1)) (<= ~M~0 thread2Thread1of1ForFork2_~i~1)), 173417#(or (<= ~N~0 (+ ~M~0 1)) (< (+ 2 ~M~0) ~N~0)), 173419#(< thread2Thread1of1ForFork2_~i~1 ~M~0), 173424#(or (< (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0) (<= ~N~0 (+ ~M~0 1)))] [2022-03-15 19:38:25,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 19:38:25,380 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:38:25,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 19:38:25,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1397, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 19:38:25,380 INFO L87 Difference]: Start difference. First operand 4416 states and 21841 transitions. Second operand has 28 states, 28 states have (on average 6.642857142857143) internal successors, (186), 27 states have internal predecessors, (186), 0 states have call successors, (0), 0 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:38:26,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:38:26,739 INFO L93 Difference]: Finished difference Result 4953 states and 23403 transitions. [2022-03-15 19:38:26,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 19:38:26,739 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.642857142857143) internal successors, (186), 27 states have internal predecessors, (186), 0 states have call successors, (0), 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:38:26,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:38:26,753 INFO L225 Difference]: With dead ends: 4953 [2022-03-15 19:38:26,754 INFO L226 Difference]: Without dead ends: 4939 [2022-03-15 19:38:26,754 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 280 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1044 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=663, Invalid=3627, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 19:38:26,755 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 297 mSDsluCounter, 1332 mSDsCounter, 0 mSdLazyCounter, 2241 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 2296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:38:26,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 257 Invalid, 2296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2241 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 19:38:26,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4939 states. [2022-03-15 19:38:26,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4939 to 4362. [2022-03-15 19:38:26,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4362 states, 4361 states have (on average 4.925475808300848) internal successors, (21480), 4361 states have internal predecessors, (21480), 0 states have call successors, (0), 0 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:38:26,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4362 states to 4362 states and 21480 transitions. [2022-03-15 19:38:26,852 INFO L78 Accepts]: Start accepts. Automaton has 4362 states and 21480 transitions. Word has length 27 [2022-03-15 19:38:26,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:38:26,852 INFO L470 AbstractCegarLoop]: Abstraction has 4362 states and 21480 transitions. [2022-03-15 19:38:26,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.642857142857143) internal successors, (186), 27 states have internal predecessors, (186), 0 states have call successors, (0), 0 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:38:26,853 INFO L276 IsEmpty]: Start isEmpty. Operand 4362 states and 21480 transitions. [2022-03-15 19:38:26,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:38:26,862 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:38:26,862 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 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:38:26,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-15 19:38:27,062 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,SelfDestructingSolverStorable23 [2022-03-15 19:38:27,063 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:38:27,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:38:27,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1724642057, now seen corresponding path program 3 times [2022-03-15 19:38:27,064 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:38:27,064 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069734405] [2022-03-15 19:38:27,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:38:27,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:38:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:38:27,113 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:38:27,113 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:38:27,113 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069734405] [2022-03-15 19:38:27,113 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069734405] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:38:27,113 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259115300] [2022-03-15 19:38:27,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:38:27,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:27,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:38:27,115 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:38:27,152 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:38:27,274 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:38:27,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:38:27,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:38:27,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:38:27,550 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:38:27,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:38:27,622 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:38:27,622 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 72 [2022-03-15 19:38:27,849 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:38:27,849 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259115300] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:38:27,849 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:38:27,849 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 22 [2022-03-15 19:38:27,849 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2110781070] [2022-03-15 19:38:27,849 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:38:27,853 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:38:27,898 INFO L252 McrAutomatonBuilder]: Finished intersection with 223 states and 571 transitions. [2022-03-15 19:38:27,899 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:38:30,403 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [187340#(<= (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0), 187341#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (<= (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 187342#(or (<= ~N~0 1) (<= 3 ~N~0))] [2022-03-15 19:38:30,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 19:38:30,403 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:38:30,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 19:38:30,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2022-03-15 19:38:30,404 INFO L87 Difference]: Start difference. First operand 4362 states and 21480 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) 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:38:30,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:38:30,671 INFO L93 Difference]: Finished difference Result 5062 states and 24553 transitions. [2022-03-15 19:38:30,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 19:38:30,675 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) 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 27 [2022-03-15 19:38:30,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:38:30,690 INFO L225 Difference]: With dead ends: 5062 [2022-03-15 19:38:30,691 INFO L226 Difference]: Without dead ends: 5062 [2022-03-15 19:38:30,691 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 223 SyntacticMatches, 8 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=755, Unknown=0, NotChecked=0, Total=930 [2022-03-15 19:38:30,691 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 122 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:38:30,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 52 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:38:30,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5062 states. [2022-03-15 19:38:30,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5062 to 4915. [2022-03-15 19:38:30,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4915 states, 4914 states have (on average 4.8998778998779) internal successors, (24078), 4914 states have internal predecessors, (24078), 0 states have call successors, (0), 0 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:38:30,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4915 states to 4915 states and 24078 transitions. [2022-03-15 19:38:30,800 INFO L78 Accepts]: Start accepts. Automaton has 4915 states and 24078 transitions. Word has length 27 [2022-03-15 19:38:30,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:38:30,801 INFO L470 AbstractCegarLoop]: Abstraction has 4915 states and 24078 transitions. [2022-03-15 19:38:30,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.090909090909091) 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:38:30,801 INFO L276 IsEmpty]: Start isEmpty. Operand 4915 states and 24078 transitions. [2022-03-15 19:38:30,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:38:30,812 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:38:30,812 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:38:30,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-15 19:38:31,012 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,SelfDestructingSolverStorable24 [2022-03-15 19:38:31,013 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:38:31,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:38:31,013 INFO L85 PathProgramCache]: Analyzing trace with hash -624196386, now seen corresponding path program 2 times [2022-03-15 19:38:31,014 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:38:31,014 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496219084] [2022-03-15 19:38:31,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:38:31,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:38:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:38:31,079 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:38:31,079 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:38:31,080 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496219084] [2022-03-15 19:38:31,080 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496219084] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:38:31,080 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315301691] [2022-03-15 19:38:31,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:38:31,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:31,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:38:31,081 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:38:31,090 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:38:31,226 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:38:31,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:38:31,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 19:38:31,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:38:31,388 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:38:31,388 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 13 [2022-03-15 19:38:31,412 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:38:31,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:38:31,459 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:38:31,459 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 72 [2022-03-15 19:38:31,571 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:38:31,571 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315301691] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:38:31,571 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:38:31,571 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 22 [2022-03-15 19:38:31,572 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [942701065] [2022-03-15 19:38:31,572 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:38:31,576 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:38:31,631 INFO L252 McrAutomatonBuilder]: Finished intersection with 212 states and 540 transitions. [2022-03-15 19:38:31,631 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:38:35,076 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [202376#(or (<= (+ 3 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 202433#(< 0 ~M~0), 202427#(or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~M~0)), 202437#(or (<= (+ 3 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0)), 202431#(or (<= (+ 3 thread3Thread1of1ForFork0_~i~2) ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~M~0)), 202432#(or (<= (+ 3 ~M~0) ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~M~0)), 202434#(or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0)), 202429#(or (<= (+ 3 ~M~0) ~N~0) (<= ~N~0 (+ ~M~0 1))), 202426#(< thread2Thread1of1ForFork2_~i~1 ~M~0), 202435#(or (<= (+ 3 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 202436#(or (< 0 ~M~0) (<= (+ 3 ~M~0) ~N~0) (<= ~N~0 (+ ~M~0 1))), 202428#(or (<= (+ 3 thread3Thread1of1ForFork0_~i~2) ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))), 202430#(or (<= (+ 3 ~M~0) ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= ~N~0 (+ ~M~0 1))), 202438#(or (< 0 ~M~0) (<= (+ 3 ~M~0) ~N~0))] [2022-03-15 19:38:35,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 19:38:35,076 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:38:35,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 19:38:35,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1060, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 19:38:35,077 INFO L87 Difference]: Start difference. First operand 4915 states and 24078 transitions. Second operand has 24 states, 24 states have (on average 6.833333333333333) internal successors, (164), 23 states have internal predecessors, (164), 0 states have call successors, (0), 0 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:38:35,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:38:35,950 INFO L93 Difference]: Finished difference Result 5341 states and 25574 transitions. [2022-03-15 19:38:35,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 19:38:35,950 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 6.833333333333333) internal successors, (164), 23 states have internal predecessors, (164), 0 states have call successors, (0), 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:38:35,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:38:35,966 INFO L225 Difference]: With dead ends: 5341 [2022-03-15 19:38:35,966 INFO L226 Difference]: Without dead ends: 5341 [2022-03-15 19:38:35,966 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 203 SyntacticMatches, 8 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 897 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=662, Invalid=2530, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 19:38:35,967 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 266 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 1286 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 1317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:38:35,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [266 Valid, 136 Invalid, 1317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1286 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:38:35,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5341 states. [2022-03-15 19:38:36,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5341 to 4973. [2022-03-15 19:38:36,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4973 states, 4972 states have (on average 4.8869670152856) internal successors, (24298), 4972 states have internal predecessors, (24298), 0 states have call successors, (0), 0 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:38:36,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4973 states to 4973 states and 24298 transitions. [2022-03-15 19:38:36,106 INFO L78 Accepts]: Start accepts. Automaton has 4973 states and 24298 transitions. Word has length 27 [2022-03-15 19:38:36,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:38:36,106 INFO L470 AbstractCegarLoop]: Abstraction has 4973 states and 24298 transitions. [2022-03-15 19:38:36,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 6.833333333333333) internal successors, (164), 23 states have internal predecessors, (164), 0 states have call successors, (0), 0 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:38:36,107 INFO L276 IsEmpty]: Start isEmpty. Operand 4973 states and 24298 transitions. [2022-03-15 19:38:36,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:38:36,118 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:38:36,118 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:38:36,135 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:38:36,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-03-15 19:38:36,319 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:38:36,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:38:36,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1038814903, now seen corresponding path program 11 times [2022-03-15 19:38:36,320 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:38:36,320 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603421505] [2022-03-15 19:38:36,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:38:36,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:38:36,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:38:36,418 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:38:36,419 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:38:36,419 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603421505] [2022-03-15 19:38:36,419 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603421505] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:38:36,419 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841570645] [2022-03-15 19:38:36,419 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:38:36,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:36,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:38:36,424 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:38:36,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-03-15 19:38:36,566 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:38:36,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:38:36,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 19:38:36,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:38:36,676 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:38:36,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:38:36,765 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:38:36,765 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841570645] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:38:36,765 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:38:36,766 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2022-03-15 19:38:36,766 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [720036826] [2022-03-15 19:38:36,766 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:38:36,769 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:38:36,789 INFO L252 McrAutomatonBuilder]: Finished intersection with 113 states and 243 transitions. [2022-03-15 19:38:36,789 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:38:37,268 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [217951#(< (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0), 217950#(< thread2Thread1of1ForFork2_~i~1 ~M~0), 217954#(or (<= ~M~0 1) (< 2 ~M~0)), 217952#(or (< (+ thread2Thread1of1ForFork2_~i~1 1) ~M~0) (<= ~M~0 thread2Thread1of1ForFork2_~i~1)), 217953#(or (<= ~M~0 (+ thread2Thread1of1ForFork2_~i~1 1)) (< (+ 2 thread2Thread1of1ForFork2_~i~1) ~M~0))] [2022-03-15 19:38:37,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:38:37,269 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:38:37,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:38:37,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2022-03-15 19:38:37,269 INFO L87 Difference]: Start difference. First operand 4973 states and 24298 transitions. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 12 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:37,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:38:37,557 INFO L93 Difference]: Finished difference Result 4639 states and 22786 transitions. [2022-03-15 19:38:37,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 19:38:37,557 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 12 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-03-15 19:38:37,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:38:37,568 INFO L225 Difference]: With dead ends: 4639 [2022-03-15 19:38:37,569 INFO L226 Difference]: Without dead ends: 4320 [2022-03-15 19:38:37,569 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=707, Unknown=0, NotChecked=0, Total=870 [2022-03-15 19:38:37,569 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 137 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:38:37,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 29 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:38:37,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4320 states. [2022-03-15 19:38:37,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4320 to 4320. [2022-03-15 19:38:37,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4320 states, 4319 states have (on average 5.080342671914795) internal successors, (21942), 4319 states have internal predecessors, (21942), 0 states have call successors, (0), 0 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:38:37,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4320 states to 4320 states and 21942 transitions. [2022-03-15 19:38:37,708 INFO L78 Accepts]: Start accepts. Automaton has 4320 states and 21942 transitions. Word has length 28 [2022-03-15 19:38:37,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:38:37,708 INFO L470 AbstractCegarLoop]: Abstraction has 4320 states and 21942 transitions. [2022-03-15 19:38:37,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 12 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:37,708 INFO L276 IsEmpty]: Start isEmpty. Operand 4320 states and 21942 transitions. [2022-03-15 19:38:37,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:38:37,718 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:38:37,718 INFO L514 BasicCegarLoop]: trace histogram [3, 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:38:37,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-03-15 19:38:37,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:37,919 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:38:37,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:38:37,920 INFO L85 PathProgramCache]: Analyzing trace with hash 400404909, now seen corresponding path program 3 times [2022-03-15 19:38:37,920 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:38:37,920 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128872174] [2022-03-15 19:38:37,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:38:37,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:38:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:38:38,320 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:38:38,320 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:38:38,320 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128872174] [2022-03-15 19:38:38,320 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128872174] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:38:38,320 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589676658] [2022-03-15 19:38:38,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:38:38,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:38,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:38:38,322 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:38:38,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-03-15 19:38:38,551 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:38:38,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:38:38,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 38 conjunts are in the unsatisfiable core [2022-03-15 19:38:38,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:38:39,127 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:38:39,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:38:39,887 INFO L353 Elim1Store]: treesize reduction 128, result has 26.0 percent of original size [2022-03-15 19:38:39,887 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 56 [2022-03-15 19:38:40,191 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:38:40,191 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589676658] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:38:40,191 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:38:40,191 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 37 [2022-03-15 19:38:40,192 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [562706259] [2022-03-15 19:38:40,192 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:38:40,195 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:38:40,272 INFO L252 McrAutomatonBuilder]: Finished intersection with 256 states and 668 transitions. [2022-03-15 19:38:40,273 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:39:04,295 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 78 new interpolants: [231521#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (< 0 ~M~0) (<= 3 ~N~0))), 231506#(or (= (mod ~sorted1~0 256) 0) (= ~sorted3~0 0) (< 3 ~N~0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (<= ~N~0 2)), 231498#(or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= (mod ~sorted1~0 256) 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (= ~sorted3~0 0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 231484#(and (or (<= (+ thread3Thread1of1ForFork0_~i~2 4) ~N~0) (<= ~N~0 (+ 2 thread3Thread1of1ForFork0_~i~2)) (<= ~sorted1~0 (* (div ~sorted1~0 256) 256))) (or (= (mod ~sorted3~0 256) 0) (<= (+ thread3Thread1of1ForFork0_~i~2 4) ~N~0) (not (< (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0)) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4)))) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 8)))))), 231511#(and (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= 3 ~N~0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= ~M~0 0))), 231467#(and (or (< 0 ~M~0) (= ~sorted3~0 0)) (or (< 0 ~M~0) (<= ~sorted1~0 (* (div ~sorted1~0 256) 256)))), 231519#(and (or (not (< 2 ~N~0)) (< 0 ~M~0) (= (mod ~sorted1~0 256) 0) (< 3 ~N~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (<= (+ 9 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) (* ~N~0 4)) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256)))) (or (not (< 2 ~N~0)) (< 0 ~M~0) (= (mod ~sorted1~0 256) 0) (< 3 ~N~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (<= (+ 9 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) (* ~N~0 4)) (not (<= (+ (div ~sorted3~0 256) 1) 0))) (or (not (< 2 ~N~0)) (= ~A~0.offset 0) (< 0 ~M~0) (= (mod ~sorted1~0 256) 0) (< 3 ~N~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))))), 231487#(and (or (<= (div ~sorted1~0 256) 0) (<= 3 ~N~0)) (= ~A~0.offset 0) (or (not (= (+ ~A~0.offset (* ~M~0 4)) 0)) (<= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= 1 ~sorted1~0)) (or (not (= (+ ~A~0.offset (* ~M~0 4)) 0)) (<= (div ~sorted1~0 256) 0) (<= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (<= 3 ~N~0) (<= 1 ~sorted1~0)) (<= ~M~0 0)), 231513#(or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (< 0 ~M~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= (mod ~sorted1~0 256) 0) (= ~sorted3~0 0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 231507#(or (= (mod ~sorted1~0 256) 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (= ~sorted3~0 0) (< 3 ~N~0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (<= ~N~0 2)), 231518#(or (< 0 ~M~0) (= (mod ~sorted1~0 256) 0) (= ~sorted3~0 0) (< 3 ~N~0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (<= ~N~0 2)), 231470#(or (< 0 ~M~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= ~sorted3~0 0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))))), 231491#(and (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= 3 ~N~0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (= thread1Thread1of1ForFork1_~i~0 0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= ~M~0 0)) (or (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) |thread1Thread1of1ForFork1_#t~mem2|) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (not (= (* ~M~0 4) (* thread1Thread1of1ForFork1_~i~0 4))))), 231453#(or (= ~sorted3~0 0) (not (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))))), 231456#(and (or (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (not (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (<= thread3Thread1of1ForFork0_~i~2 1) (not (<= (+ (div ~sorted3~0 256) 1) 0)) (not (= (mod ~sorted1~0 256) 0))) (or (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (not (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (<= 3 ~N~0) (not (= (mod ~sorted1~0 256) 0)) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256)))) (or (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (not (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (<= (+ 9 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) (* ~N~0 4)) (not (= (mod ~sorted1~0 256) 0)) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256)))) (or (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (not (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (<= thread3Thread1of1ForFork0_~i~2 1) (not (= (mod ~sorted1~0 256) 0)) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256)))) (or (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (not (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (<= 3 ~N~0) (not (<= (+ (div ~sorted3~0 256) 1) 0)) (not (= (mod ~sorted1~0 256) 0))) (or (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (not (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (<= (+ 9 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) (* ~N~0 4)) (not (<= (+ (div ~sorted3~0 256) 1) 0)) (not (= (mod ~sorted1~0 256) 0))) (or (= ~A~0.offset 0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (not (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (not (= (mod ~sorted1~0 256) 0)))), 231444#(and (or (<= ~sorted1~0 (* (div ~sorted1~0 256) 256)) (< thread2Thread1of1ForFork2_~i~1 ~M~0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (= ~sorted3~0 0))), 231516#(and (or (< 0 ~M~0) (= thread1Thread1of1ForFork1_~i~0 0)) (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (< 0 ~M~0) (<= 3 ~N~0))), 231509#(and (or (not (< 2 ~N~0)) (= (mod ~sorted1~0 256) 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< 3 ~N~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (<= (+ 9 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) (* ~N~0 4)) (not (<= (+ (div ~sorted3~0 256) 1) 0))) (or (not (< 2 ~N~0)) (= ~A~0.offset 0) (= (mod ~sorted1~0 256) 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< 3 ~N~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (or (not (< 2 ~N~0)) (= (mod ~sorted1~0 256) 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< 3 ~N~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (<= (+ 9 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) (* ~N~0 4)) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256))))), 231472#(and (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0) (<= ~sorted1~0 (* (div ~sorted1~0 256) 256)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< 0 ~M~0) (= ~sorted3~0 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0))), 231502#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork1_~i~0 0) (<= 3 ~N~0) (<= ~M~0 0)), 231497#(and (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (= (mod ~sorted1~0 256) 0) (<= thread3Thread1of1ForFork0_~i~2 1) (not (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256)))) (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (= (mod ~sorted1~0 256) 0) (not (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (<= 3 ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (not (<= (+ (div ~sorted3~0 256) 1) 0))) (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (= (mod ~sorted1~0 256) 0) (not (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (<= (+ 9 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) (* ~N~0 4)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256)))) (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (= (mod ~sorted1~0 256) 0) (not (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (<= (+ 9 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) (* ~N~0 4)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (not (<= (+ (div ~sorted3~0 256) 1) 0))) (or (= ~A~0.offset 0) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (= (mod ~sorted1~0 256) 0) (not (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)) (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (= (mod ~sorted1~0 256) 0) (not (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (<= 3 ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256)))) (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (= (mod ~sorted1~0 256) 0) (<= thread3Thread1of1ForFork0_~i~2 1) (not (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (not (<= (+ (div ~sorted3~0 256) 1) 0)))), 231464#(and (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= (+ 9 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) (* ~N~0 4)) (not (<= (+ (div ~sorted3~0 256) 1) 0))) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= 3 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256)))) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (not (<= (+ (div ~sorted1~0 256) 1) 0)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= thread3Thread1of1ForFork0_~i~2 1) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256)))) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= (+ 9 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) (* ~N~0 4)) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256)))) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= thread3Thread1of1ForFork0_~i~2 1) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (not (<= (+ (div ~sorted3~0 256) 1) 0))) (or (<= ~sorted1~0 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= 3 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (not (<= (+ (div ~sorted3~0 256) 1) 0)))), 231450#(or (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (not (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (= ~sorted3~0 0) (not (= (mod ~sorted1~0 256) 0))), 231496#(or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= (mod ~sorted1~0 256) 0) (= ~sorted3~0 0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 231490#(and (= ~A~0.offset 0) (or (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) |thread1Thread1of1ForFork1_#t~mem2|) (not (= (* ~M~0 4) (* thread1Thread1of1ForFork1_~i~0 4)))) (= thread1Thread1of1ForFork1_~i~0 0) (<= 3 ~N~0) (<= ~M~0 0)), 231504#(or (= (mod ~sorted1~0 256) 0) (= ~sorted3~0 0) (< 3 ~N~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (<= ~N~0 2)), 231454#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= ~sorted3~0 0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))))), 231463#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (= ~sorted3~0 0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))))), 231480#(and (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= 3 ~N~0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (= thread1Thread1of1ForFork1_~i~0 0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= thread3Thread1of1ForFork0_~i~2 0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (not (= (* thread3Thread1of1ForFork0_~i~2 4) (* thread1Thread1of1ForFork1_~i~0 4))))), 231452#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (= ~sorted3~0 0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (not (= (mod ~sorted1~0 256) 0))), 231468#(and (or (< 0 ~M~0) (<= ~sorted1~0 (* (div ~sorted1~0 256) 256)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (< 0 ~M~0) (= ~sorted3~0 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0))), 231458#(and (or (<= ~sorted1~0 (* (div ~sorted1~0 256) 256)) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (= ~sorted3~0 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0))), 231461#(and (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (= ~sorted3~0 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~sorted1~0 (* (div ~sorted1~0 256) 256)) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0))), 231514#(and (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (< 0 ~M~0) (= (mod ~sorted1~0 256) 0) (not (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (<= (+ 9 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) (* ~N~0 4)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (not (<= (+ (div ~sorted3~0 256) 1) 0))) (or (= ~A~0.offset 0) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (< 0 ~M~0) (= (mod ~sorted1~0 256) 0) (not (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)) (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (< 0 ~M~0) (= (mod ~sorted1~0 256) 0) (not (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (<= 3 ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256)))) (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (< 0 ~M~0) (= (mod ~sorted1~0 256) 0) (<= thread3Thread1of1ForFork0_~i~2 1) (not (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (not (<= (+ (div ~sorted3~0 256) 1) 0))) (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (< 0 ~M~0) (= (mod ~sorted1~0 256) 0) (not (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (<= 3 ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (not (<= (+ (div ~sorted3~0 256) 1) 0))) (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (< 0 ~M~0) (= (mod ~sorted1~0 256) 0) (<= thread3Thread1of1ForFork0_~i~2 1) (not (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256)))) (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (< 0 ~M~0) (= (mod ~sorted1~0 256) 0) (not (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (<= (+ 9 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) (* ~N~0 4)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256))))), 231482#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (not (= 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (< 0 ~M~0) (<= (div ~sorted1~0 256) 0) (<= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (< 0 ~M~0) (<= thread3Thread1of1ForFork0_~i~2 0)) (or (< 0 ~M~0) (<= 3 ~N~0) (<= 1 ~sorted1~0)) (or (< 0 ~M~0) (<= (div ~sorted1~0 256) 0) (<= 3 ~N~0)) (or (not (= 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (< 0 ~M~0) (<= 1 ~sorted1~0) (<= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))))), 231451#(and (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~sorted1~0 (* (div ~sorted1~0 256) 256)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (<= (+ 2 thread3Thread1of1ForFork0_~i~2) ~N~0) (= ~sorted3~0 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0))), 231445#(and (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (= ~sorted3~0 0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (or (<= ~sorted1~0 (* (div ~sorted1~0 256) 256)) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0))), 231457#(and (or (not (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (<= 3 ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256)))) (or (<= thread3Thread1of1ForFork0_~i~2 1) (not (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (not (<= (+ (div ~sorted3~0 256) 1) 0)) (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))))) (or (not (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (<= (+ 9 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) (* ~N~0 4)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (not (<= (+ (div ~sorted3~0 256) 1) 0)) (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))))) (or (not (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (<= 3 ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (not (<= (+ (div ~sorted3~0 256) 1) 0)) (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))))) (or (not (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (<= (+ 9 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) (* ~N~0 4)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256)))) (or (= ~A~0.offset 0) (not (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))))) (or (<= thread3Thread1of1ForFork0_~i~2 1) (not (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256))))), 231471#(and (or (< 0 ~M~0) (<= ~sorted1~0 (* (div ~sorted1~0 256) 256)) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (or (< 0 ~M~0) (= ~sorted3~0 0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0))), 231446#(and (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (not (<= (+ (div ~sorted1~0 256) 1) 0))) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= 3 ~N~0) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256)))) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= (+ 9 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) (* ~N~0 4)) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256)))) (or (<= ~sorted1~0 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= (+ 9 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) (* ~N~0 4)) (not (<= (+ (div ~sorted3~0 256) 1) 0))) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= thread3Thread1of1ForFork0_~i~2 1) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256)))) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= 3 ~N~0) (not (<= (+ (div ~sorted3~0 256) 1) 0))) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= thread3Thread1of1ForFork0_~i~2 1) (not (<= (+ (div ~sorted3~0 256) 1) 0)))), 231455#(and (or (<= ~sorted1~0 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (<= 3 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (not (<= (+ (div ~sorted3~0 256) 1) 0))) (or (<= thread3Thread1of1ForFork0_~i~2 1) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (not (<= (+ (div ~sorted3~0 256) 1) 0))) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= (+ 9 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) (* ~N~0 4)) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256)))) (or (<= thread3Thread1of1ForFork0_~i~2 1) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256)))) (or (not (<= (+ (div ~sorted1~0 256) 1) 0)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (= ~A~0.offset 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (<= 3 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256)))) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= (+ 9 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) (* ~N~0 4)) (not (<= (+ (div ~sorted3~0 256) 1) 0)))), 231449#(and (or (= ~sorted3~0 0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (<= ~sorted1~0 (* (div ~sorted1~0 256) 256)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0))), 231483#(and (or (< 0 ~M~0) (= thread1Thread1of1ForFork1_~i~0 0)) (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (< 0 ~M~0) (<= thread3Thread1of1ForFork0_~i~2 0)) (or (< 0 ~M~0) (<= 3 ~N~0)) (or (< 0 ~M~0) (= |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (not (= (* thread3Thread1of1ForFork0_~i~2 4) (* thread1Thread1of1ForFork1_~i~0 4))))), 231478#(and (or (< 0 ~M~0) (not (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (<= (+ 9 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) (* ~N~0 4)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (not (<= (+ (div ~sorted3~0 256) 1) 0)) (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))))) (or (< 0 ~M~0) (<= thread3Thread1of1ForFork0_~i~2 1) (not (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (not (<= (+ (div ~sorted3~0 256) 1) 0)) (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))))) (or (< 0 ~M~0) (not (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (<= 3 ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (not (<= (+ (div ~sorted3~0 256) 1) 0)) (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))))) (or (= ~A~0.offset 0) (< 0 ~M~0) (not (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))))) (or (< 0 ~M~0) (not (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (<= (+ 9 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) (* ~N~0 4)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256)))) (or (< 0 ~M~0) (<= thread3Thread1of1ForFork0_~i~2 1) (not (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256)))) (or (< 0 ~M~0) (not (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (<= 3 ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256))))), 231473#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< 0 ~M~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (= ~sorted3~0 0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (not (= (mod ~sorted1~0 256) 0))), 231512#(or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (< 0 ~M~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= (mod ~sorted1~0 256) 0) (= ~sorted3~0 0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 231459#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (= ~sorted3~0 0) (not (= (mod ~sorted1~0 256) 0))), 231477#(and (or (< 0 ~M~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (not (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (<= (+ 9 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) (* ~N~0 4)) (not (= (mod ~sorted1~0 256) 0)) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256)))) (or (< 0 ~M~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (not (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (<= 3 ~N~0) (not (<= (+ (div ~sorted3~0 256) 1) 0)) (not (= (mod ~sorted1~0 256) 0))) (or (= ~A~0.offset 0) (< 0 ~M~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (not (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (not (= (mod ~sorted1~0 256) 0))) (or (< 0 ~M~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (not (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (<= thread3Thread1of1ForFork0_~i~2 1) (not (= (mod ~sorted1~0 256) 0)) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256)))) (or (< 0 ~M~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (not (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (<= (+ 9 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) (* ~N~0 4)) (not (<= (+ (div ~sorted3~0 256) 1) 0)) (not (= (mod ~sorted1~0 256) 0))) (or (< 0 ~M~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (not (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (<= thread3Thread1of1ForFork0_~i~2 1) (not (<= (+ (div ~sorted3~0 256) 1) 0)) (not (= (mod ~sorted1~0 256) 0))) (or (< 0 ~M~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (not (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (<= 3 ~N~0) (not (= (mod ~sorted1~0 256) 0)) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256))))), 231500#(and (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (= (mod ~sorted1~0 256) 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (not (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (<= 3 ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (not (<= (+ (div ~sorted3~0 256) 1) 0))) (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (= (mod ~sorted1~0 256) 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (not (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (<= (+ 9 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) (* ~N~0 4)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256)))) (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (= (mod ~sorted1~0 256) 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (not (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (<= (+ 9 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) (* ~N~0 4)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (not (<= (+ (div ~sorted3~0 256) 1) 0))) (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (= (mod ~sorted1~0 256) 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (not (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (<= 3 ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256)))) (or (= ~A~0.offset 0) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (= (mod ~sorted1~0 256) 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (not (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)) (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (= (mod ~sorted1~0 256) 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= thread3Thread1of1ForFork0_~i~2 1) (not (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256)))) (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (= (mod ~sorted1~0 256) 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= thread3Thread1of1ForFork0_~i~2 1) (not (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (not (<= (+ (div ~sorted3~0 256) 1) 0)))), 231495#(or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= (mod ~sorted1~0 256) 0) (= ~sorted3~0 0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 231515#(and (or (< 0 ~M~0) (= thread1Thread1of1ForFork1_~i~0 0)) (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (< 0 ~M~0) (<= thread3Thread1of1ForFork0_~i~2 0)) (or (< 0 ~M~0) (<= 3 ~N~0))), 231479#(and (or (not (= 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= (div ~sorted1~0 256) 0) (<= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0)) (or (not (= 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= 1 ~sorted1~0) (<= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= thread3Thread1of1ForFork0_~i~2 0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= (div ~sorted1~0 256) 0) (<= 3 ~N~0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= 3 ~N~0) (<= 1 ~sorted1~0))), 231466#(and (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= thread3Thread1of1ForFork0_~i~2 1) (not (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (not (<= (+ (div ~sorted3~0 256) 1) 0)) (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))))) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (not (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (<= 3 ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256)))) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (not (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (<= 3 ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (not (<= (+ (div ~sorted3~0 256) 1) 0)) (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))))) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (not (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))))) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= thread3Thread1of1ForFork0_~i~2 1) (not (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256)))) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (not (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (<= (+ 9 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) (* ~N~0 4)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (not (<= (+ (div ~sorted3~0 256) 1) 0)) (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))))) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (not (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0)) (<= (+ 9 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) (* ~N~0 4)) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256))))), 231505#(or (= (mod ~sorted1~0 256) 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (= ~sorted3~0 0) (< 3 ~N~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (<= ~N~0 2)), 231475#(and (or (<= ~sorted1~0 0) (< 0 ~M~0)) (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (< 0 ~M~0) (<= 3 ~N~0) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256)))) (or (< 0 ~M~0) (<= 3 ~N~0) (not (<= (+ (div ~sorted3~0 256) 1) 0))) (or (< 0 ~M~0) (<= thread3Thread1of1ForFork0_~i~2 1) (not (<= (+ (div ~sorted3~0 256) 1) 0))) (or (< 0 ~M~0) (<= thread3Thread1of1ForFork0_~i~2 1) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256)))) (or (< 0 ~M~0) (<= (+ 9 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) (* ~N~0 4)) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256)))) (or (< 0 ~M~0) (not (<= (+ (div ~sorted1~0 256) 1) 0))) (or (< 0 ~M~0) (<= (+ 9 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) (* ~N~0 4)) (not (<= (+ (div ~sorted3~0 256) 1) 0)))), 231476#(and (or (= ~A~0.offset 0) (< 0 ~M~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (< 0 ~M~0) (<= 3 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256)))) (or (< 0 ~M~0) (<= 3 ~N~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (not (<= (+ (div ~sorted3~0 256) 1) 0))) (or (<= ~sorted1~0 0) (< 0 ~M~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (< 0 ~M~0) (not (<= (+ (div ~sorted1~0 256) 1) 0)) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (< 0 ~M~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= (+ 9 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) (* ~N~0 4)) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256)))) (or (< 0 ~M~0) (<= thread3Thread1of1ForFork0_~i~2 1) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (not (<= (+ (div ~sorted3~0 256) 1) 0))) (or (< 0 ~M~0) (<= thread3Thread1of1ForFork0_~i~2 1) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256)))) (or (< 0 ~M~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= (+ 9 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) (* ~N~0 4)) (not (<= (+ (div ~sorted3~0 256) 1) 0)))), 231510#(and (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= 3 ~N~0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= thread3Thread1of1ForFork0_~i~2 0))), 231499#(or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= (mod ~sorted1~0 256) 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (= ~sorted3~0 0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0)), 231494#(and (or (< 0 ~M~0) (= thread1Thread1of1ForFork1_~i~0 0)) (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (< 0 ~M~0) (<= 3 ~N~0)) (or (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) |thread1Thread1of1ForFork1_#t~mem2|) (< 0 ~M~0) (not (= (* ~M~0 4) (* thread1Thread1of1ForFork1_~i~0 4))))), 231481#(and (or (<= ~sorted1~0 0) (< 0 ~M~0)) (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (not (= 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (< 0 ~M~0) (<= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (< 0 ~M~0) (<= thread3Thread1of1ForFork0_~i~2 0)) (or (< 0 ~M~0) (<= 3 ~N~0)) (or (< 0 ~M~0) (not (<= (+ (div ~sorted1~0 256) 1) 0)))), 231520#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (< 0 ~M~0) (<= thread3Thread1of1ForFork0_~i~2 0)) (or (< 0 ~M~0) (<= 3 ~N~0))), 231493#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (< 0 ~M~0) (not (= (+ ~A~0.offset (* ~M~0 4)) 0)) (<= (div ~sorted1~0 256) 0) (<= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (<= 3 ~N~0) (<= 1 ~sorted1~0)) (or (< 0 ~M~0) (not (= (+ ~A~0.offset (* ~M~0 4)) 0)) (<= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= 1 ~sorted1~0)) (or (< 0 ~M~0) (<= (div ~sorted1~0 256) 0) (<= 3 ~N~0))), 231501#(and (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= 3 ~N~0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (= thread1Thread1of1ForFork1_~i~0 0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= thread3Thread1of1ForFork0_~i~2 0))), 231469#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< 0 ~M~0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (= ~sorted3~0 0) (not (= (mod ~sorted1~0 256) 0))), 231447#(and (or (not (= 0 (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))))) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (not (<= (+ (div ~sorted1~0 256) 1) 0))) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= 3 ~N~0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= thread3Thread1of1ForFork0_~i~2 0)) (or (<= ~sorted1~0 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0))), 231474#(or (< 0 ~M~0) (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (= ~sorted3~0 0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))))), 231489#(and (or (not (= (+ ~A~0.offset (* ~M~0 4)) 0)) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= (div ~sorted1~0 256) 0) (<= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0)) (or (not (= (+ ~A~0.offset (* ~M~0 4)) 0)) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (<= 1 ~sorted1~0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= (div ~sorted1~0 256) 0) (<= 3 ~N~0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= 3 ~N~0) (<= 1 ~sorted1~0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= ~M~0 0))), 231460#(or (<= ~N~0 (+ 2 thread1Thread1of1ForFork1_~i~0)) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (= ~sorted3~0 0) (< (+ 3 thread1Thread1of1ForFork1_~i~0) ~N~0) (< |thread1Thread1of1ForFork1_#t~mem2| (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4))))), 231462#(or (<= ~N~0 (+ thread1Thread1of1ForFork1_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (= ~sorted3~0 0) (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (not (= (mod ~sorted1~0 256) 0))), 231465#(and (or (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (not (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (<= thread3Thread1of1ForFork0_~i~2 1) (not (= (mod ~sorted1~0 256) 0)) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256)))) (or (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (not (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (<= 3 ~N~0) (not (= (mod ~sorted1~0 256) 0)) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256)))) (or (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (not (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (<= thread3Thread1of1ForFork0_~i~2 1) (not (<= (+ (div ~sorted3~0 256) 1) 0)) (not (= (mod ~sorted1~0 256) 0))) (or (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (not (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (<= (+ 9 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) (* ~N~0 4)) (not (<= (+ (div ~sorted3~0 256) 1) 0)) (not (= (mod ~sorted1~0 256) 0))) (or (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (not (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (<= (+ 9 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) (* ~N~0 4)) (not (= (mod ~sorted1~0 256) 0)) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256)))) (or (= ~A~0.offset 0) (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (not (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (not (= (mod ~sorted1~0 256) 0))) (or (< (+ 2 thread1Thread1of1ForFork1_~i~0) ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (not (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (<= 3 ~N~0) (not (<= (+ (div ~sorted3~0 256) 1) 0)) (not (= (mod ~sorted1~0 256) 0)))), 231508#(and (or (not (< 2 ~N~0)) (= ~A~0.offset 0) (= (mod ~sorted1~0 256) 0) (< 3 ~N~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (or (not (< 2 ~N~0)) (= (mod ~sorted1~0 256) 0) (< 3 ~N~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (<= (+ 9 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) (* ~N~0 4)) (not (<= (+ (div ~sorted3~0 256) 1) 0))) (or (not (< 2 ~N~0)) (= (mod ~sorted1~0 256) 0) (< 3 ~N~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (<= (+ 9 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4)) (* ~N~0 4)) (<= ~sorted3~0 (* 256 (div ~sorted3~0 256))))), 231485#(and (or (<= ~N~0 (+ 2 ~M~0)) (<= ~sorted1~0 (* (div ~sorted1~0 256) 256)) (<= (+ ~M~0 4) ~N~0)) (or (not (< (+ 2 ~M~0) ~N~0)) (= (mod ~sorted3~0 256) 0) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 8)))) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4) 4)))) (<= (+ ~M~0 4) ~N~0))), 231492#(and (or (<= ~sorted1~0 0) (< 0 ~M~0)) (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (< 0 ~M~0) (<= 3 ~N~0)) (or (< 0 ~M~0) (not (<= (+ (div ~sorted1~0 256) 1) 0))) (or (< 0 ~M~0) (not (= (+ ~A~0.offset (* ~M~0 4)) 0)) (<= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))))), 231488#(and (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= 3 ~N~0)) (or (not (= (+ ~A~0.offset (* ~M~0 4)) 0)) (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (<= ~sorted1~0 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0)) (or (< 0 (+ (div ~sorted1~0 256) 1)) (< thread2Thread1of1ForFork2_~i~1 ~M~0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= ~M~0 0))), 231503#(and (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork2_~i~1 ~M~0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= 3 ~N~0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (= thread1Thread1of1ForFork1_~i~0 0)) (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (<= ~M~0 0))), 231486#(and (= ~A~0.offset 0) (< 0 (+ (div ~sorted1~0 256) 1)) (<= ~sorted1~0 0) (or (not (= (+ ~A~0.offset (* ~M~0 4)) 0)) (<= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (<= 3 ~N~0) (<= ~M~0 0)), 231517#(or (< 0 ~M~0) (= (mod ~sorted1~0 256) 0) (= ~sorted3~0 0) (< 3 ~N~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (<= ~N~0 2)), 231448#(and (or (= (mod ~sorted3~0 256) 0) (<= (+ 3 thread3Thread1of1ForFork0_~i~2) ~N~0) (not (< (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0)) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 4))))) (or (<= (+ 3 thread3Thread1of1ForFork0_~i~2) ~N~0) (<= ~sorted1~0 (* (div ~sorted1~0 256) 256)) (<= ~N~0 (+ thread3Thread1of1ForFork0_~i~2 1))))] [2022-03-15 19:39:04,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2022-03-15 19:39:04,296 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:39:04,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2022-03-15 19:39:04,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1137, Invalid=12203, Unknown=0, NotChecked=0, Total=13340 [2022-03-15 19:39:04,297 INFO L87 Difference]: Start difference. First operand 4320 states and 21942 transitions. Second operand has 95 states, 94 states have (on average 3.872340425531915) internal successors, (364), 94 states have internal predecessors, (364), 0 states have call successors, (0), 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:43:42,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 948 states. [2022-03-15 19:43:42,891 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 19:43:42,891 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:43:42,913 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1243 GetRequests, 165 SyntacticMatches, 17 SemanticMatches, 1060 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495753 ImplicationChecksByTransitivity, 266.8s TimeCoverageRelationStatistics Valid=120257, Invalid=1006525, Unknown=0, NotChecked=0, Total=1126782 [2022-03-15 19:43:42,914 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 5484 mSDsluCounter, 1871 mSDsCounter, 0 mSdLazyCounter, 15739 mSolverCounterSat, 5271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5484 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 21010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5271 IncrementalHoareTripleChecker+Valid, 15739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:42,914 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5484 Valid, 720 Invalid, 21010 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5271 Valid, 15739 Invalid, 0 Unknown, 0 Unchecked, 13.6s Time] [2022-03-15 19:43:42,915 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-03-15 19:43:42,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-03-15 19:43:43,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-03-15 19:43:43,116 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (4320states) and FLOYD_HOARE automaton (currently 948 states, 95 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 1062 known predicates. [2022-03-15 19:43:43,117 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 19:43:43,118 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 19:43:43,118 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 19:43:43,119 INFO L732 BasicCegarLoop]: Path program histogram: [11, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2022-03-15 19:43:43,121 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 19:43:43,121 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 19:43:43,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 07:43:43 BasicIcfg [2022-03-15 19:43:43,123 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 19:43:43,124 INFO L158 Benchmark]: Toolchain (without parser) took 715692.25ms. Allocated memory was 182.5MB in the beginning and 1.1GB in the end (delta: 882.9MB). Free memory was 127.3MB in the beginning and 537.4MB in the end (delta: -410.1MB). Peak memory consumption was 473.8MB. Max. memory is 8.0GB. [2022-03-15 19:43:43,124 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 182.5MB. Free memory is still 143.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 19:43:43,124 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.59ms. Allocated memory was 182.5MB in the beginning and 246.4MB in the end (delta: 64.0MB). Free memory was 127.0MB in the beginning and 215.9MB in the end (delta: -88.8MB). Peak memory consumption was 8.5MB. Max. memory is 8.0GB. [2022-03-15 19:43:43,124 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.86ms. Allocated memory is still 246.4MB. Free memory was 215.9MB in the beginning and 213.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 19:43:43,124 INFO L158 Benchmark]: Boogie Preprocessor took 38.37ms. Allocated memory is still 246.4MB. Free memory was 213.8MB in the beginning and 212.6MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 19:43:43,124 INFO L158 Benchmark]: RCFGBuilder took 371.42ms. Allocated memory is still 246.4MB. Free memory was 212.1MB in the beginning and 196.4MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-03-15 19:43:43,125 INFO L158 Benchmark]: TraceAbstraction took 714868.69ms. Allocated memory was 246.4MB in the beginning and 1.1GB in the end (delta: 818.9MB). Free memory was 195.9MB in the beginning and 537.4MB in the end (delta: -341.4MB). Peak memory consumption was 479.0MB. Max. memory is 8.0GB. [2022-03-15 19:43:43,125 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 182.5MB. Free memory is still 143.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 357.59ms. Allocated memory was 182.5MB in the beginning and 246.4MB in the end (delta: 64.0MB). Free memory was 127.0MB in the beginning and 215.9MB in the end (delta: -88.8MB). Peak memory consumption was 8.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.86ms. Allocated memory is still 246.4MB. Free memory was 215.9MB in the beginning and 213.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.37ms. Allocated memory is still 246.4MB. Free memory was 213.8MB in the beginning and 212.6MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 371.42ms. Allocated memory is still 246.4MB. Free memory was 212.1MB in the beginning and 196.4MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 714868.69ms. Allocated memory was 246.4MB in the beginning and 1.1GB in the end (delta: 818.9MB). Free memory was 195.9MB in the beginning and 537.4MB in the end (delta: -341.4MB). Peak memory consumption was 479.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 179 PlacesBefore, 36 PlacesAfterwards, 184 TransitionsBefore, 32 TransitionsAfterwards, 3534 CoEnabledTransitionPairs, 8 FixpointIterations, 93 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 19 TrivialYvCompositions, 20 ConcurrentYvCompositions, 9 ChoiceCompositions, 189 TotalNumberOfCompositions, 4306 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3694, positive: 3631, positive conditional: 0, positive unconditional: 3631, negative: 63, negative conditional: 0, negative unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2025, positive: 2007, positive conditional: 0, positive unconditional: 2007, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3694, positive: 1624, positive conditional: 0, positive unconditional: 1624, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 2025, unknown conditional: 0, unknown unconditional: 2025] , Statistics on independence cache: Total cache size (in pairs): 84, Positive cache size: 79, Positive conditional cache size: 0, Positive unconditional cache size: 79, 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: 92]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (4320states) and FLOYD_HOARE automaton (currently 948 states, 95 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 1062 known predicates. - TimeoutResultAtElement [Line: 84]: 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 (4320states) and FLOYD_HOARE automaton (currently 948 states, 95 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 1062 known predicates. - TimeoutResultAtElement [Line: 85]: 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 (4320states) and FLOYD_HOARE automaton (currently 948 states, 95 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 1062 known predicates. - TimeoutResultAtElement [Line: 86]: 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 (4320states) and FLOYD_HOARE automaton (currently 948 states, 95 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 1062 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 224 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 714.7s, OverallIterations: 28, TraceHistogramMax: 3, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.2s, AutomataDifference: 520.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.7s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12270 SdHoareTripleChecker+Valid, 40.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12270 mSDsluCounter, 3967 SdHoareTripleChecker+Invalid, 34.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14914 mSDsCounter, 7256 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 58476 IncrementalHoareTripleChecker+Invalid, 65732 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7256 mSolverCounterUnsat, 405 mSDtfsCounter, 58476 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6859 GetRequests, 3378 SyntacticMatches, 884 SemanticMatches, 2596 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 677460 ImplicationChecksByTransitivity, 497.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4973occurred in iteration=26, InterpolantAutomatonStates: 1006, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 44163 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 27.5s InterpolantComputationTime, 1323 NumberOfCodeBlocks, 1321 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 1863 ConstructedInterpolants, 28 QuantifiedInterpolants, 37149 SizeOfPredicates, 285 NumberOfNonLiveVariables, 5827 ConjunctsInSsa, 610 ConjunctsInUnsatCore, 76 InterpolantComputations, 6 PerfectInterpolantSequences, 225/417 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