/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/gemcutter/NewStatesSleepPersistentFixedOrder-VarAbsGlobalSmt.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7707f89-m [2022-11-16 16:33:21,194 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 16:33:21,195 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 16:33:21,226 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 16:33:21,226 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 16:33:21,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 16:33:21,231 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 16:33:21,233 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 16:33:21,235 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 16:33:21,239 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 16:33:21,239 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 16:33:21,241 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 16:33:21,241 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 16:33:21,243 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 16:33:21,244 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 16:33:21,245 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 16:33:21,245 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 16:33:21,246 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 16:33:21,247 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 16:33:21,251 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 16:33:21,252 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 16:33:21,253 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 16:33:21,254 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 16:33:21,255 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 16:33:21,260 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 16:33:21,260 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 16:33:21,260 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 16:33:21,262 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 16:33:21,262 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 16:33:21,262 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 16:33:21,263 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 16:33:21,263 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 16:33:21,264 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 16:33:21,265 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 16:33:21,265 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 16:33:21,266 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 16:33:21,266 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 16:33:21,266 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 16:33:21,266 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 16:33:21,267 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 16:33:21,267 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 16:33:21,268 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder-VarAbsGlobalSmt.epf [2022-11-16 16:33:21,292 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 16:33:21,292 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 16:33:21,292 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 16:33:21,292 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 16:33:21,293 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 16:33:21,293 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 16:33:21,294 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 16:33:21,294 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 16:33:21,294 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 16:33:21,294 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 16:33:21,295 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 16:33:21,295 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 16:33:21,295 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 16:33:21,295 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 16:33:21,295 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 16:33:21,295 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 16:33:21,295 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 16:33:21,295 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 16:33:21,295 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 16:33:21,295 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 16:33:21,295 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 16:33:21,295 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 16:33:21,296 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 16:33:21,296 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-16 16:33:21,296 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 16:33:21,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 16:33:21,296 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 16:33:21,296 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 16:33:21,296 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 16:33:21,296 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 16:33:21,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 16:33:21,296 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 16:33:21,297 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-11-16 16:33:21,297 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-16 16:33:21,297 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 16:33:21,297 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-16 16:33:21,297 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-16 16:33:21,297 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP [2022-11-16 16:33:21,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 16:33:21,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 16:33:21,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 16:33:21,520 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 16:33:21,520 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 16:33:21,521 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_longest.i [2022-11-16 16:33:21,567 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/986bd3ae9/42e1697836e042a7b443cbe7df9bf79c/FLAG19d543bd9 [2022-11-16 16:33:22,095 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 16:33:22,095 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i [2022-11-16 16:33:22,110 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/986bd3ae9/42e1697836e042a7b443cbe7df9bf79c/FLAG19d543bd9 [2022-11-16 16:33:22,545 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/986bd3ae9/42e1697836e042a7b443cbe7df9bf79c [2022-11-16 16:33:22,547 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 16:33:22,548 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-16 16:33:22,549 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 16:33:22,550 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 16:33:22,563 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 16:33:22,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:33:22" (1/1) ... [2022-11-16 16:33:22,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@585077d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:33:22, skipping insertion in model container [2022-11-16 16:33:22,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:33:22" (1/1) ... [2022-11-16 16:33:22,571 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 16:33:22,594 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 16:33:22,911 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43296,43309] [2022-11-16 16:33:22,916 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43503,43516] [2022-11-16 16:33:22,918 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43783,43796] [2022-11-16 16:33:22,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 16:33:22,928 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 16:33:22,962 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43296,43309] [2022-11-16 16:33:22,963 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43503,43516] [2022-11-16 16:33:22,965 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43783,43796] [2022-11-16 16:33:22,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 16:33:23,013 INFO L208 MainTranslator]: Completed translation [2022-11-16 16:33:23,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:33:23 WrapperNode [2022-11-16 16:33:23,013 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 16:33:23,016 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 16:33:23,016 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 16:33:23,016 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 16:33:23,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:33:23" (1/1) ... [2022-11-16 16:33:23,054 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:33:23" (1/1) ... [2022-11-16 16:33:23,082 INFO L138 Inliner]: procedures = 274, calls = 62, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 243 [2022-11-16 16:33:23,082 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 16:33:23,083 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 16:33:23,083 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 16:33:23,083 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 16:33:23,089 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:33:23" (1/1) ... [2022-11-16 16:33:23,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:33:23" (1/1) ... [2022-11-16 16:33:23,093 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:33:23" (1/1) ... [2022-11-16 16:33:23,093 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:33:23" (1/1) ... [2022-11-16 16:33:23,114 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:33:23" (1/1) ... [2022-11-16 16:33:23,118 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:33:23" (1/1) ... [2022-11-16 16:33:23,119 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:33:23" (1/1) ... [2022-11-16 16:33:23,120 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:33:23" (1/1) ... [2022-11-16 16:33:23,122 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 16:33:23,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 16:33:23,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 16:33:23,123 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 16:33:23,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:33:23" (1/1) ... [2022-11-16 16:33:23,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 16:33:23,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 16:33:23,146 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-11-16 16:33:23,151 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-11-16 16:33:23,192 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-16 16:33:23,192 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-16 16:33:23,192 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-16 16:33:23,192 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-16 16:33:23,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 16:33:23,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 16:33:23,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 16:33:23,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 16:33:23,192 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-16 16:33:23,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 16:33:23,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 16:33:23,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 16:33:23,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 16:33:23,193 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 16:33:23,357 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 16:33:23,358 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 16:33:23,665 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 16:33:23,673 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 16:33:23,673 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-16 16:33:23,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 04:33:23 BoogieIcfgContainer [2022-11-16 16:33:23,675 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 16:33:23,676 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 16:33:23,676 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 16:33:23,678 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 16:33:23,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:33:22" (1/3) ... [2022-11-16 16:33:23,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39840051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:33:23, skipping insertion in model container [2022-11-16 16:33:23,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:33:23" (2/3) ... [2022-11-16 16:33:23,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39840051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:33:23, skipping insertion in model container [2022-11-16 16:33:23,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 04:33:23" (3/3) ... [2022-11-16 16:33:23,680 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longest.i [2022-11-16 16:33:23,685 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 16:33:23,691 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 16:33:23,691 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-11-16 16:33:23,691 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 16:33:23,754 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-16 16:33:23,802 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 16:33:23,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-16 16:33:23,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 16:33:23,805 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-16 16:33:23,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-16 16:33:23,840 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-16 16:33:23,848 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2022-11-16 16:33:23,851 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4f55ec95, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 16:33:23,852 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 16:33:24,170 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 16:33:24,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:33:24,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1072998195, now seen corresponding path program 1 times [2022-11-16 16:33:24,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 16:33:24,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458492429] [2022-11-16 16:33:24,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:33:24,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:33:24,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:33:24,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 16:33:24,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 16:33:24,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458492429] [2022-11-16 16:33:24,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458492429] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:33:24,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:33:24,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 16:33:24,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640654454] [2022-11-16 16:33:24,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:33:24,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 16:33:24,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 16:33:24,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 16:33:24,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 16:33:24,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:24,469 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 16:33:24,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 49.0) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 16:33:24,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:24,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:24,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 16:33:24,513 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 16:33:24,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:33:24,514 INFO L85 PathProgramCache]: Analyzing trace with hash 205824109, now seen corresponding path program 1 times [2022-11-16 16:33:24,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 16:33:24,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856432286] [2022-11-16 16:33:24,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:33:24,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:33:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:33:24,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 16:33:24,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 16:33:24,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856432286] [2022-11-16 16:33:24,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856432286] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:33:24,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:33:24,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 16:33:24,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999026816] [2022-11-16 16:33:24,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:33:24,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 16:33:24,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 16:33:24,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 16:33:24,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 16:33:24,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:24,717 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 16:33:24,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 16:33:24,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:24,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:24,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:24,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:24,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 16:33:24,770 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 16:33:24,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:33:24,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1012824832, now seen corresponding path program 1 times [2022-11-16 16:33:24,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 16:33:24,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48695645] [2022-11-16 16:33:24,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:33:24,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:33:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:33:26,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 16:33:26,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 16:33:26,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48695645] [2022-11-16 16:33:26,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48695645] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:33:26,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:33:26,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-16 16:33:26,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51171440] [2022-11-16 16:33:26,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:33:26,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-16 16:33:26,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 16:33:26,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-16 16:33:26,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-11-16 16:33:26,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:26,103 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 16:33:26,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.705882352941177) internal successors, (114), 17 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 16:33:26,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:26,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:26,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:26,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:26,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:26,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 16:33:26,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 16:33:26,664 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 16:33:26,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:33:26,664 INFO L85 PathProgramCache]: Analyzing trace with hash 969017787, now seen corresponding path program 1 times [2022-11-16 16:33:26,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 16:33:26,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043253661] [2022-11-16 16:33:26,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:33:26,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:33:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:33:29,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 16:33:29,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 16:33:29,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043253661] [2022-11-16 16:33:29,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043253661] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:33:29,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:33:29,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-11-16 16:33:29,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783657230] [2022-11-16 16:33:29,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:33:29,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-16 16:33:29,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 16:33:29,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-16 16:33:29,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2022-11-16 16:33:29,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:29,005 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 16:33:29,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.538461538461538) internal successors, (118), 26 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 16:33:29,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:29,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:29,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-16 16:33:29,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:30,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:30,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:30,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 16:33:30,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-16 16:33:30,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 16:33:30,852 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 16:33:30,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:33:30,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1518472118, now seen corresponding path program 1 times [2022-11-16 16:33:30,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 16:33:30,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664011838] [2022-11-16 16:33:30,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:33:30,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:33:30,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:33:30,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 16:33:30,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 16:33:30,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664011838] [2022-11-16 16:33:30,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664011838] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:33:30,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:33:30,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 16:33:30,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485598960] [2022-11-16 16:33:30,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:33:30,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 16:33:30,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 16:33:30,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 16:33:30,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 16:33:30,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:30,903 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 16:33:30,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 16:33:30,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:30,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:30,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-16 16:33:30,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-16 16:33:30,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:31,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:31,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:31,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 16:33:31,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-16 16:33:31,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:31,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 16:33:31,015 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 16:33:31,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:33:31,015 INFO L85 PathProgramCache]: Analyzing trace with hash -133683344, now seen corresponding path program 1 times [2022-11-16 16:33:31,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 16:33:31,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927607313] [2022-11-16 16:33:31,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:33:31,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:33:31,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:33:33,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 16:33:33,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 16:33:33,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927607313] [2022-11-16 16:33:33,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927607313] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:33:33,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:33:33,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-11-16 16:33:33,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209959390] [2022-11-16 16:33:33,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:33:33,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-16 16:33:33,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 16:33:33,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-16 16:33:33,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=789, Unknown=0, NotChecked=0, Total=870 [2022-11-16 16:33:33,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:33,858 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 16:33:33,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.1) internal successors, (123), 30 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 16:33:33,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:33,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:33,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-16 16:33:33,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-16 16:33:33,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:33,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:35,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:35,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:35,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 16:33:35,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-16 16:33:35,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:35,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 16:33:35,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 16:33:35,920 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 16:33:35,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:33:35,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1940192969, now seen corresponding path program 1 times [2022-11-16 16:33:35,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 16:33:35,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845842887] [2022-11-16 16:33:35,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:33:35,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:33:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:33:36,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 16:33:36,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 16:33:36,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845842887] [2022-11-16 16:33:36,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845842887] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:33:36,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:33:36,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 16:33:36,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362583610] [2022-11-16 16:33:36,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:33:36,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 16:33:36,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 16:33:36,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 16:33:36,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 16:33:36,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:36,002 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 16:33:36,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 16:33:36,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:36,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:36,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-16 16:33:36,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-16 16:33:36,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:36,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-16 16:33:36,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:36,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:36,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:36,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 16:33:36,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-16 16:33:36,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:36,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 16:33:36,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:33:36,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 16:33:36,038 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 16:33:36,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:33:36,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1194863548, now seen corresponding path program 2 times [2022-11-16 16:33:36,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 16:33:36,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351274676] [2022-11-16 16:33:36,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:33:36,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:33:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:33:38,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 16:33:38,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 16:33:38,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351274676] [2022-11-16 16:33:38,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351274676] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:33:38,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:33:38,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-11-16 16:33:38,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549790407] [2022-11-16 16:33:38,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:33:38,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-16 16:33:38,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 16:33:38,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-16 16:33:38,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=669, Unknown=0, NotChecked=0, Total=756 [2022-11-16 16:33:38,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:38,063 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 16:33:38,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.392857142857143) internal successors, (123), 28 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 16:33:38,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:38,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:38,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-16 16:33:38,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-16 16:33:38,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:38,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-16 16:33:38,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:33:38,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:40,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:40,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:40,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 16:33:40,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-16 16:33:40,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:40,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 16:33:40,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:33:40,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-16 16:33:40,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 16:33:40,879 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 16:33:40,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:33:40,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1817523668, now seen corresponding path program 1 times [2022-11-16 16:33:40,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 16:33:40,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855690438] [2022-11-16 16:33:40,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:33:40,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:33:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:33:40,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 16:33:40,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 16:33:40,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855690438] [2022-11-16 16:33:40,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855690438] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:33:40,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:33:40,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 16:33:40,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846594281] [2022-11-16 16:33:40,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:33:40,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 16:33:40,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 16:33:40,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 16:33:40,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 16:33:40,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:40,999 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 16:33:41,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 16:33:41,000 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:41,000 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:41,000 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-16 16:33:41,000 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-16 16:33:41,000 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:41,000 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-16 16:33:41,000 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:33:41,000 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-16 16:33:41,000 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:41,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:41,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:41,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 16:33:41,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-16 16:33:41,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:41,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 16:33:41,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:33:41,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 16:33:41,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:33:41,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 16:33:41,435 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 16:33:41,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:33:41,436 INFO L85 PathProgramCache]: Analyzing trace with hash -587525970, now seen corresponding path program 1 times [2022-11-16 16:33:41,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 16:33:41,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724578233] [2022-11-16 16:33:41,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:33:41,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:33:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:33:41,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 16:33:41,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 16:33:41,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724578233] [2022-11-16 16:33:41,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724578233] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:33:41,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:33:41,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-16 16:33:41,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535544950] [2022-11-16 16:33:41,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:33:41,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 16:33:41,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 16:33:41,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 16:33:41,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-16 16:33:41,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:41,724 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 16:33:41,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 16:33:41,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:41,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:41,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-16 16:33:41,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-11-16 16:33:41,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:41,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-16 16:33:41,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:33:41,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-16 16:33:41,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:33:41,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:42,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:42,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:42,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 16:33:42,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-16 16:33:42,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:42,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 16:33:42,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:33:42,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 16:33:42,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:33:42,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 16:33:42,006 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-16 16:33:42,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 16:33:42,022 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:33:42,023 INFO L307 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork0 was SAFE (1/3) [2022-11-16 16:33:42,028 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 16:33:42,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-16 16:33:42,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 16:33:42,031 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-16 16:33:42,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2022-11-16 16:33:42,038 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-16 16:33:42,038 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-11-16 16:33:42,039 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4f55ec95, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 16:33:42,039 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-11-16 16:33:42,051 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 16:33:42,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:33:42,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1751721974, now seen corresponding path program 1 times [2022-11-16 16:33:42,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 16:33:42,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279953783] [2022-11-16 16:33:42,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:33:42,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:33:42,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:33:42,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 16:33:42,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 16:33:42,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279953783] [2022-11-16 16:33:42,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279953783] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:33:42,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:33:42,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 16:33:42,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064969718] [2022-11-16 16:33:42,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:33:42,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 16:33:42,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 16:33:42,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 16:33:42,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 16:33:42,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:42,068 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 16:33:42,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 16:33:42,069 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:42,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:42,181 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-11-16 16:33:42,181 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-11-16 16:33:42,181 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-11-16 16:33:42,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 16:33:42,184 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2022-11-16 16:33:42,184 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE,SAFE (2/3) [2022-11-16 16:33:42,186 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 16:33:42,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-16 16:33:42,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 16:33:42,225 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-16 16:33:42,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2022-11-16 16:33:42,228 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-16 16:33:42,229 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork1 ======== [2022-11-16 16:33:42,230 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4f55ec95, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 16:33:42,230 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 16:33:42,321 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 16:33:42,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:33:42,321 INFO L85 PathProgramCache]: Analyzing trace with hash 928321693, now seen corresponding path program 1 times [2022-11-16 16:33:42,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 16:33:42,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100525611] [2022-11-16 16:33:42,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:33:42,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:33:42,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:33:42,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 16:33:42,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 16:33:42,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100525611] [2022-11-16 16:33:42,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100525611] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:33:42,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:33:42,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 16:33:42,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467925692] [2022-11-16 16:33:42,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:33:42,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 16:33:42,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 16:33:42,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 16:33:42,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 16:33:42,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:42,342 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 16:33:42,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 71.5) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 16:33:42,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:42,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:42,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 16:33:42,351 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 16:33:42,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:33:42,351 INFO L85 PathProgramCache]: Analyzing trace with hash 112962813, now seen corresponding path program 1 times [2022-11-16 16:33:42,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 16:33:42,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043888447] [2022-11-16 16:33:42,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:33:42,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:33:42,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:33:42,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 16:33:42,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 16:33:42,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043888447] [2022-11-16 16:33:42,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043888447] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:33:42,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:33:42,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 16:33:42,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285493917] [2022-11-16 16:33:42,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:33:42,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 16:33:42,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 16:33:42,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 16:33:42,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 16:33:42,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:42,391 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 16:33:42,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 16:33:42,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:42,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:42,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:42,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:42,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 16:33:42,416 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 16:33:42,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:33:42,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1901618358, now seen corresponding path program 1 times [2022-11-16 16:33:42,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 16:33:42,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404758902] [2022-11-16 16:33:42,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:33:42,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:33:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:33:42,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 16:33:42,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 16:33:42,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404758902] [2022-11-16 16:33:42,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404758902] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:33:42,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:33:42,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 16:33:42,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854832079] [2022-11-16 16:33:42,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:33:42,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 16:33:42,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 16:33:42,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 16:33:42,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 16:33:42,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:42,530 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 16:33:42,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 16:33:42,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:42,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:42,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:42,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:42,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:42,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:33:42,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 16:33:42,583 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 16:33:42,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:33:42,584 INFO L85 PathProgramCache]: Analyzing trace with hash -534059007, now seen corresponding path program 1 times [2022-11-16 16:33:42,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 16:33:42,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052675918] [2022-11-16 16:33:42,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:33:42,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:33:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:33:42,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 16:33:42,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 16:33:42,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052675918] [2022-11-16 16:33:42,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052675918] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:33:42,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:33:42,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 16:33:42,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070256985] [2022-11-16 16:33:42,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:33:42,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 16:33:42,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 16:33:42,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 16:33:42,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 16:33:42,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:42,658 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 16:33:42,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 16:33:42,658 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:42,658 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:42,658 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:33:42,658 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:42,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:42,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:42,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:33:42,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:42,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 16:33:42,716 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 16:33:42,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:33:42,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1526931374, now seen corresponding path program 1 times [2022-11-16 16:33:42,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 16:33:42,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182675581] [2022-11-16 16:33:42,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:33:42,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:33:42,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:33:42,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 16:33:42,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 16:33:42,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182675581] [2022-11-16 16:33:42,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182675581] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:33:42,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:33:42,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 16:33:42,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486162995] [2022-11-16 16:33:42,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:33:42,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 16:33:42,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 16:33:42,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 16:33:42,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 16:33:42,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:42,784 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 16:33:42,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 16:33:42,785 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:42,785 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:42,785 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:33:42,785 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:42,785 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:42,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:42,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:42,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:33:42,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:42,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:33:42,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 16:33:42,860 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 16:33:42,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:33:42,860 INFO L85 PathProgramCache]: Analyzing trace with hash 507940128, now seen corresponding path program 1 times [2022-11-16 16:33:42,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 16:33:42,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494590529] [2022-11-16 16:33:42,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:33:42,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:33:42,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:33:43,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 16:33:43,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 16:33:43,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494590529] [2022-11-16 16:33:43,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494590529] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:33:43,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:33:43,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-16 16:33:43,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421479191] [2022-11-16 16:33:43,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:33:43,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-16 16:33:43,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 16:33:43,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-16 16:33:43,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-11-16 16:33:43,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:43,980 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 16:33:43,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 11.529411764705882) internal successors, (196), 17 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 16:33:43,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:43,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:43,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:33:43,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:43,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:33:43,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:44,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:44,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:44,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:33:44,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:44,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:33:44,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 16:33:44,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 16:33:44,529 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 16:33:44,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:33:44,529 INFO L85 PathProgramCache]: Analyzing trace with hash -2144984805, now seen corresponding path program 1 times [2022-11-16 16:33:44,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 16:33:44,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078034044] [2022-11-16 16:33:44,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:33:44,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:33:44,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:33:51,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 16:33:51,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 16:33:51,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078034044] [2022-11-16 16:33:51,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078034044] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:33:51,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:33:51,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-11-16 16:33:51,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451448200] [2022-11-16 16:33:51,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:33:51,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-16 16:33:51,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 16:33:51,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-16 16:33:51,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1249, Unknown=0, NotChecked=0, Total=1406 [2022-11-16 16:33:51,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:51,027 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 16:33:51,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 5.2631578947368425) internal successors, (200), 38 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 16:33:51,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:51,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:51,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:33:51,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:51,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:33:51,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-16 16:33:51,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:55,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:55,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:55,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:33:55,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:55,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:33:55,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 16:33:55,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-16 16:33:55,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 16:33:55,887 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 16:33:55,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:33:55,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1977224726, now seen corresponding path program 1 times [2022-11-16 16:33:55,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 16:33:55,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662845213] [2022-11-16 16:33:55,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:33:55,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:33:55,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:33:57,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 16:33:57,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 16:33:57,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662845213] [2022-11-16 16:33:57,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662845213] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:33:57,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:33:57,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-11-16 16:33:57,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750964977] [2022-11-16 16:33:57,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:33:57,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-16 16:33:57,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 16:33:57,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-16 16:33:57,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2022-11-16 16:33:57,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:57,543 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 16:33:57,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.8) internal successors, (204), 30 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 16:33:57,543 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:57,543 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:57,543 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:33:57,543 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:57,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:33:57,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-16 16:33:57,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-11-16 16:33:57,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:58,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:33:58,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:58,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:33:58,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:33:58,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:33:58,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 16:33:58,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-16 16:33:58,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-16 16:33:58,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 16:33:58,927 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 16:33:58,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:33:58,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1169226838, now seen corresponding path program 1 times [2022-11-16 16:33:58,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 16:33:58,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573231242] [2022-11-16 16:33:58,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:33:58,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:33:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:34:02,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 16:34:02,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 16:34:02,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573231242] [2022-11-16 16:34:02,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573231242] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:34:02,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:34:02,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-11-16 16:34:02,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148408791] [2022-11-16 16:34:02,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:34:02,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-16 16:34:02,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 16:34:02,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-16 16:34:02,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1091, Unknown=0, NotChecked=0, Total=1260 [2022-11-16 16:34:02,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:34:02,342 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 16:34:02,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.666666666666667) internal successors, (204), 36 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 16:34:02,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:34:02,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:34:02,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:34:02,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:34:02,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:34:02,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-16 16:34:02,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-11-16 16:34:02,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-16 16:34:02,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:34:05,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:34:05,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:34:05,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:34:05,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:34:05,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:34:05,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 16:34:05,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-16 16:34:05,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-16 16:34:05,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-16 16:34:05,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-16 16:34:05,114 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 16:34:05,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:34:05,115 INFO L85 PathProgramCache]: Analyzing trace with hash 2008994769, now seen corresponding path program 1 times [2022-11-16 16:34:05,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 16:34:05,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309977821] [2022-11-16 16:34:05,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:34:05,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:34:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:34:09,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 16:34:09,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 16:34:09,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309977821] [2022-11-16 16:34:09,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309977821] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:34:09,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:34:09,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-11-16 16:34:09,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739131964] [2022-11-16 16:34:09,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:34:09,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-16 16:34:09,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 16:34:09,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-16 16:34:09,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2081, Unknown=0, NotChecked=0, Total=2256 [2022-11-16 16:34:09,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:34:09,486 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 16:34:09,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 4.333333333333333) internal successors, (208), 48 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 16:34:09,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:34:09,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:34:09,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:34:09,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:34:09,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:34:09,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-16 16:34:09,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-11-16 16:34:09,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-16 16:34:09,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-16 16:34:09,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:34:16,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:34:16,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:34:16,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:34:16,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:34:16,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:34:16,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 16:34:16,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-16 16:34:16,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-16 16:34:16,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-16 16:34:16,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-16 16:34:16,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-16 16:34:16,450 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 16:34:16,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:34:16,450 INFO L85 PathProgramCache]: Analyzing trace with hash -100422824, now seen corresponding path program 1 times [2022-11-16 16:34:16,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 16:34:16,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598969097] [2022-11-16 16:34:16,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:34:16,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:34:16,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:34:16,582 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 16:34:16,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 16:34:16,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598969097] [2022-11-16 16:34:16,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598969097] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:34:16,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844706251] [2022-11-16 16:34:16,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:34:16,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:34:16,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 16:34:16,585 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-11-16 16:34:16,644 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-11-16 16:34:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:34:16,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 16:34:16,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:34:16,891 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 16:34:16,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:34:16,984 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 16:34:16,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844706251] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 16:34:16,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 16:34:16,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-16 16:34:16,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359430912] [2022-11-16 16:34:16,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 16:34:16,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 16:34:16,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 16:34:16,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 16:34:16,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-16 16:34:16,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:34:16,987 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 16:34:16,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 40.2) internal successors, (402), 10 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 16:34:16,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:34:16,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:34:16,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:34:16,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:34:16,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:34:16,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-16 16:34:16,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-11-16 16:34:16,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-16 16:34:16,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-16 16:34:16,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2022-11-16 16:34:16,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:34:17,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:34:17,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:34:17,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:34:17,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:34:17,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:34:17,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 16:34:17,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-16 16:34:17,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-16 16:34:17,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-16 16:34:17,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-16 16:34:17,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 16:34:17,144 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-11-16 16:34:17,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:34:17,342 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 16:34:17,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:34:17,342 INFO L85 PathProgramCache]: Analyzing trace with hash 474472794, now seen corresponding path program 1 times [2022-11-16 16:34:17,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 16:34:17,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955291394] [2022-11-16 16:34:17,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:34:17,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:34:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:34:20,173 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 40 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 16:34:20,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 16:34:20,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955291394] [2022-11-16 16:34:20,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955291394] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:34:20,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819484041] [2022-11-16 16:34:20,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:34:20,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:34:20,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 16:34:20,176 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-11-16 16:34:20,177 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-11-16 16:34:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:34:20,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 128 conjunts are in the unsatisfiable core [2022-11-16 16:34:20,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:34:20,513 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 16:34:20,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 16:34:20,552 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 16:34:20,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 16:34:20,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 16:34:20,758 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 22 [2022-11-16 16:34:21,227 INFO L350 Elim1Store]: Elim1 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 31 treesize of output 29 [2022-11-16 16:34:21,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:34:21,546 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:34:21,558 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-16 16:34:21,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 39 [2022-11-16 16:34:21,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:34:21,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:34:21,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2022-11-16 16:34:21,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 27 [2022-11-16 16:34:22,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:34:22,041 INFO L350 Elim1Store]: Elim1 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 33 treesize of output 31 [2022-11-16 16:34:22,418 INFO L350 Elim1Store]: Elim1 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 33 treesize of output 31 [2022-11-16 16:34:22,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:34:22,780 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:34:22,790 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-16 16:34:22,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2022-11-16 16:34:22,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:34:22,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:34:22,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2022-11-16 16:34:23,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 29 [2022-11-16 16:34:23,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:34:23,193 INFO L350 Elim1Store]: Elim1 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 33 treesize of output 31 [2022-11-16 16:34:23,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:34:23,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:34:23,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2022-11-16 16:34:23,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2022-11-16 16:34:23,825 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:34:23,831 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-16 16:34:23,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 27 [2022-11-16 16:34:23,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:34:23,878 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 20 [2022-11-16 16:34:23,889 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2022-11-16 16:34:23,918 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 40 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 16:34:23,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:34:24,741 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_975 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_969) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_975) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1)))))) is different from false [2022-11-16 16:34:24,781 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_975 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_969) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_975) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1)))))) is different from false [2022-11-16 16:34:24,789 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_975 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_969) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_975) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1)))))) is different from false [2022-11-16 16:34:24,797 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_975 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_969) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_975) .cse1) 800))))) is different from false [2022-11-16 16:34:24,829 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_965 Int) (v_ArrVal_975 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_965) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_969) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_975) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1)))))) is different from false [2022-11-16 16:34:24,855 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_965 Int) (v_ArrVal_964 Int) (v_ArrVal_975 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_964)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_965) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_969) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1))) (not (= 800 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_975) .cse1)))))) is different from false [2022-11-16 16:34:24,868 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_965 Int) (v_ArrVal_964 Int) (v_ArrVal_975 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store .cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_964))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_965) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_969) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_975) .cse1) 800))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse4 .cse3)))))) is different from false [2022-11-16 16:34:24,892 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_969 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_965 Int) (v_ArrVal_964 Int) (v_ArrVal_975 Int)) (let ((.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store .cse2 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_964))) (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_965) .cse3 (+ (select .cse4 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_969) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_975) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1))))))) is different from false [2022-11-16 16:34:27,927 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_969 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_965 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_964 Int) (v_ArrVal_975 Int) (v_ArrVal_961 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_961))) (let ((.cse5 (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_962))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_964))) (store (store .cse6 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_965) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_969) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse0 .cse1))) (not (= 800 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_975) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse2 .cse1))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (= (select .cse3 .cse1) (select .cse3 (+ 3200 |c_~#queue~0.offset|)))))))))) is different from false [2022-11-16 16:34:28,186 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_969 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_965 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_964 Int) (v_ArrVal_975 Int) (v_ArrVal_961 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_961))) (let ((.cse5 (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_962))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_964))) (store (store .cse6 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_965) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_969) |c_~#queue~0.base|))) (or (not (= 800 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_975) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (= (select .cse3 (+ 3200 |c_~#queue~0.offset|)) (select .cse3 .cse1))))))))) is different from false [2022-11-16 16:34:28,209 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_969 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_965 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_964 Int) (v_ArrVal_975 Int) (v_ArrVal_961 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse7 .cse8 (+ (select .cse7 .cse8) 1)))) |c_~#stored_elements~0.base| v_ArrVal_961))) (let ((.cse5 (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_962))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_964))) (store (store .cse6 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_965) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_969) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse2 .cse1))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (= (select .cse3 (+ 3200 |c_~#queue~0.offset|)) (select .cse3 .cse1))) (not (= 800 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_975) .cse1))))))))) is different from false [2022-11-16 16:34:28,311 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_958 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_965 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_964 Int) (v_ArrVal_975 Int) (v_ArrVal_961 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_958) .cse8 (+ (select .cse7 .cse8) 1)))) |c_~#stored_elements~0.base| v_ArrVal_961))) (let ((.cse5 (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_962))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_964))) (store (store .cse6 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_965) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_969) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse2 .cse1))) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_975) .cse1) 800)) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (= (select .cse3 .cse1) (select .cse3 (+ 3200 |c_~#queue~0.offset|)))))))))) is different from false [2022-11-16 16:34:28,389 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_958 Int) (v_ArrVal_956 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_965 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_964 Int) (v_ArrVal_975 Int) (v_ArrVal_961 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse7 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_956)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_958) .cse8 (+ (select .cse7 .cse8) 1)))) |c_~#stored_elements~0.base| v_ArrVal_961))) (let ((.cse5 (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_962))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_964))) (store (store .cse6 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_965) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_969) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse2 .cse1))) (not (= 800 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_975) .cse1))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (= (select .cse3 (+ 3200 |c_~#queue~0.offset|)) (select .cse3 .cse1))))))))) is different from false [2022-11-16 16:34:28,423 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_958 Int) (v_ArrVal_956 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_965 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_964 Int) (v_ArrVal_975 Int) (v_ArrVal_961 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_956))) (store (store .cse9 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_958) .cse1 (+ (select .cse9 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_961))) (let ((.cse7 (store .cse5 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_962))) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_964))) (store (store .cse8 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_965) .cse3 (+ (select .cse8 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_969) |c_~#queue~0.base|))) (or (not (= 800 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_975) .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse2 .cse3))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (= (select .cse4 (+ 3200 |c_~#queue~0.offset|)) (select .cse4 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse6 .cse3)))))))))))) is different from false [2022-11-16 16:34:28,481 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_958 Int) (v_ArrVal_956 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_965 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_964 Int) (v_ArrVal_975 Int) (v_ArrVal_961 (Array Int Int))) (let ((.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse9 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_956))) (store (store .cse9 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_958) .cse4 (+ (select .cse9 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_961))) (let ((.cse7 (store .cse6 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_962))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse0 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_964))) (store (store .cse8 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_965) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_969) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse3 .cse4))) (not (= 800 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_975) .cse1))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (= (select .cse5 .cse1) (select .cse5 (+ 3200 |c_~#queue~0.offset|))))))))))) is different from false [2022-11-16 16:34:29,080 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_958 Int) (v_ArrVal_956 Int) (v_ArrVal_965 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_964 Int) (v_ArrVal_975 Int) (v_ArrVal_961 (Array Int Int)) (v_ArrVal_954 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_954))) (let ((.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse4 (select .cse9 |c_~#queue~0.base|))) (let ((.cse3 (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_956))) (store (store .cse10 .cse8 v_ArrVal_958) .cse1 (+ (select .cse10 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_961))) (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_962))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_964))) (store (store .cse7 .cse8 v_ArrVal_965) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_969) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1))) (let ((.cse2 (select .cse3 |c_~#queue~0.base|))) (= (select .cse2 .cse1) (select .cse2 (+ 3200 |c_~#queue~0.offset|)))) (not (= 800 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_975) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse4 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse5 .cse1))))))))))) is different from false [2022-11-16 16:34:30,211 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_958 Int) (v_ArrVal_956 Int) (v_ArrVal_965 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_964 Int) (v_ArrVal_975 Int) (v_ArrVal_952 Int) (v_ArrVal_961 (Array Int Int)) (v_ArrVal_954 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_952)))) (let ((.cse12 (store .cse8 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_954))) (let ((.cse11 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse0 (select .cse12 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse12 |c_~#queue~0.base| (let ((.cse13 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_956))) (store (store .cse13 .cse11 v_ArrVal_958) .cse1 (+ (select .cse13 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_961))) (let ((.cse9 (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_962))) (let ((.cse5 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (select (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_964))) (store (store .cse10 .cse11 v_ArrVal_965) .cse1 (+ (select .cse10 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_969) |c_~#queue~0.base|)) (.cse3 (+ 3200 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (= (select .cse2 .cse3) (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse5 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse6 .cse1))) (not (= (select (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_975) .cse1) 800)) (not (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (= (select .cse7 .cse3) (select .cse7 .cse1))))))))))))) is different from false [2022-11-16 16:34:30,282 INFO L321 Elim1Store]: treesize reduction 96, result has 47.0 percent of original size [2022-11-16 16:34:30,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 1858 treesize of output 1426 [2022-11-16 16:34:30,328 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 16:34:30,328 INFO L350 Elim1Store]: Elim1 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 2979 treesize of output 2933 [2022-11-16 16:34:30,349 INFO L350 Elim1Store]: Elim1 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 1883 treesize of output 1787 [2022-11-16 16:34:30,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 2158 treesize of output 2114 [2022-11-16 16:34:30,408 INFO L350 Elim1Store]: Elim1 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 2090 treesize of output 2018 [2022-11-16 16:34:30,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 2175 treesize of output 2123 [2022-11-16 16:34:30,772 INFO L350 Elim1Store]: Elim1 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 8 treesize of output 4 [2022-11-16 16:34:31,720 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 16:34:31,721 INFO L350 Elim1Store]: Elim1 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 354 treesize of output 308 [2022-11-16 16:34:32,465 INFO L321 Elim1Store]: treesize reduction 5, result has 89.8 percent of original size [2022-11-16 16:34:32,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 45 treesize of output 80 [2022-11-16 16:34:32,562 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 40 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2022-11-16 16:34:32,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819484041] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 16:34:32,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 16:34:32,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 42, 49] total 125 [2022-11-16 16:34:32,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110092147] [2022-11-16 16:34:32,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 16:34:32,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 125 states [2022-11-16 16:34:32,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 16:34:32,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2022-11-16 16:34:32,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1043, Invalid=10507, Unknown=74, NotChecked=3876, Total=15500 [2022-11-16 16:34:32,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:34:32,568 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 16:34:32,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 125 states, 125 states have (on average 5.752) internal successors, (719), 125 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 16:34:32,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:34:32,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:34:32,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:34:32,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:34:32,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:34:32,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-16 16:34:32,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-11-16 16:34:32,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-16 16:34:32,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-16 16:34:32,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2022-11-16 16:34:32,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 16:34:32,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:34:52,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 16:34:52,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:34:52,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:34:52,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:34:52,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:34:52,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 16:34:52,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-16 16:34:52,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-16 16:34:52,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-16 16:34:52,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-16 16:34:52,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 16:34:52,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-11-16 16:34:52,792 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-11-16 16:34:52,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-16 16:34:52,992 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 16:34:52,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:34:52,993 INFO L85 PathProgramCache]: Analyzing trace with hash 2120910101, now seen corresponding path program 1 times [2022-11-16 16:34:52,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 16:34:52,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907995997] [2022-11-16 16:34:52,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:34:52,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:34:53,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:34:58,168 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 16:34:58,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 16:34:58,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907995997] [2022-11-16 16:34:58,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907995997] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 16:34:58,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050666637] [2022-11-16 16:34:58,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:34:58,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 16:34:58,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 16:34:58,179 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-11-16 16:34:58,180 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-11-16 16:34:58,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:34:58,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 174 conjunts are in the unsatisfiable core [2022-11-16 16:34:58,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 16:34:58,480 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 16:34:58,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 16:34:58,529 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 16:34:58,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 16:34:58,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 16:34:58,775 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 22 [2022-11-16 16:34:59,342 INFO L350 Elim1Store]: Elim1 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 31 treesize of output 29 [2022-11-16 16:34:59,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:34:59,830 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:34:59,842 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-16 16:34:59,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 39 [2022-11-16 16:34:59,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:34:59,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:34:59,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2022-11-16 16:35:00,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 27 [2022-11-16 16:35:00,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:35:00,396 INFO L350 Elim1Store]: Elim1 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 33 treesize of output 31 [2022-11-16 16:35:01,050 INFO L350 Elim1Store]: Elim1 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 33 treesize of output 31 [2022-11-16 16:35:01,904 INFO L321 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2022-11-16 16:35:01,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 58 [2022-11-16 16:35:02,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:35:02,300 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:35:02,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:35:02,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:35:02,302 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 16:35:02,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:35:02,315 INFO L321 Elim1Store]: treesize reduction 57, result has 23.0 percent of original size [2022-11-16 16:35:02,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 93 treesize of output 86 [2022-11-16 16:35:02,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 38 [2022-11-16 16:35:02,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:35:02,847 INFO L350 Elim1Store]: Elim1 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 36 treesize of output 29 [2022-11-16 16:35:03,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:35:03,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:35:03,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2022-11-16 16:35:03,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:35:03,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 31 [2022-11-16 16:35:04,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:35:04,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:35:04,483 INFO L321 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2022-11-16 16:35:04,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 63 [2022-11-16 16:35:04,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:35:04,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:35:04,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:35:04,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2022-11-16 16:35:04,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:35:04,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2022-11-16 16:35:05,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:35:05,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:35:05,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2022-11-16 16:35:05,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:35:05,885 INFO L321 Elim1Store]: treesize reduction 25, result has 34.2 percent of original size [2022-11-16 16:35:05,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 60 [2022-11-16 16:35:06,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 16:35:06,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-11-16 16:35:06,192 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 16:35:06,192 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 26 [2022-11-16 16:35:06,398 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2022-11-16 16:35:06,451 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 16:35:06,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 16:35:06,703 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset|))) (and (forall ((v_ArrVal_1150 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) .cse0) 0))) (or (< 0 |c_t2Thread1of1ForFork1_dequeue_~x~0#1|) (forall ((v_ArrVal_1150 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) .cse0) 1)))))) is different from false [2022-11-16 16:35:18,954 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_25| Int) (v_ArrVal_1140 Int) (v_ArrVal_1142 Int) (v_ArrVal_1145 Int) (v_ArrVal_1147 Int) (v_ArrVal_1137 Int) (v_ArrVal_1139 Int) (v_ArrVal_1150 (Array Int Int))) (let ((.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ 3200 |c_~#queue~0.offset|)) (.cse2 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (store (store (store .cse2 .cse6 v_ArrVal_1137) .cse3 v_ArrVal_1139) (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1140))) (let ((.cse4 (let ((.cse5 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse6 v_ArrVal_1142) .cse1 v_ArrVal_1145)))) (store .cse5 |c_~#stored_elements~0.base| (store (select .cse5 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_25| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1147))))) (or (= 800 (select .cse0 .cse1)) (< |v_t1Thread1of1ForFork0_~i~0#1_25| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1139) (not (= (select (select .cse4 |c_~#queue~0.base|) .cse3) 800)) (not (= (select (select (store .cse4 |c_~#queue~0.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) 0))))))) is different from false [2022-11-16 16:35:21,129 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_25| Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1142 Int) (v_ArrVal_1145 Int) (v_ArrVal_1147 Int) (v_ArrVal_1137 Int) (v_ArrVal_1139 Int) (v_ArrVal_1150 (Array Int Int))) (let ((.cse6 (let ((.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1132)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |c_t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse4 (select .cse6 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (store (store (store .cse4 .cse7 v_ArrVal_1137) .cse1 v_ArrVal_1139) (+ |c_~#queue~0.offset| (* (select .cse4 .cse3) 4)) v_ArrVal_1140))) (let ((.cse0 (let ((.cse5 (store .cse6 |c_~#queue~0.base| (store (store .cse2 .cse7 v_ArrVal_1142) .cse3 v_ArrVal_1145)))) (store .cse5 |c_~#stored_elements~0.base| (store (select .cse5 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_25| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1147))))) (or (not (= (select (select .cse0 |c_~#queue~0.base|) .cse1) 800)) (= 800 (select .cse2 .cse3)) (< |v_t1Thread1of1ForFork0_~i~0#1_25| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1139) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) 0)))))))) is different from false [2022-11-16 16:35:21,694 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_25| Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1131 Int) (v_ArrVal_1142 Int) (v_ArrVal_1145 Int) (v_ArrVal_1147 Int) (v_ArrVal_1137 Int) (v_ArrVal_1139 Int) (v_ArrVal_1150 (Array Int Int))) (let ((.cse6 (let ((.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1131) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1132)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |c_t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse2 (select .cse6 |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (store (store (store .cse2 .cse7 v_ArrVal_1137) .cse1 v_ArrVal_1139) (+ |c_~#queue~0.offset| (* (select .cse2 .cse4) 4)) v_ArrVal_1140))) (let ((.cse0 (let ((.cse5 (store .cse6 |c_~#queue~0.base| (store (store .cse3 .cse7 v_ArrVal_1142) .cse4 v_ArrVal_1145)))) (store .cse5 |c_~#stored_elements~0.base| (store (select .cse5 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_25| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1147))))) (or (not (= (select (select .cse0 |c_~#queue~0.base|) .cse1) 800)) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1139) (< |v_t1Thread1of1ForFork0_~i~0#1_25| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) 0)) (= (select .cse3 .cse4) 800))))))) is different from false [2022-11-16 16:35:38,252 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_25| Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1131 Int) (v_ArrVal_1142 Int) (v_ArrVal_1145 Int) (v_ArrVal_1147 Int) (v_ArrVal_1137 Int) (v_ArrVal_1139 Int) (v_ArrVal_1150 (Array Int Int))) (let ((.cse6 (let ((.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |c_t1Thread1of1ForFork0_enqueue_#in~x#1|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1131) (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204) v_ArrVal_1132)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |c_t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ 3200 |c_~#queue~0.offset|)) (.cse4 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (store (store (store .cse4 .cse7 v_ArrVal_1137) .cse3 v_ArrVal_1139) (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1140))) (let ((.cse2 (let ((.cse5 (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse7 v_ArrVal_1142) .cse1 v_ArrVal_1145)))) (store .cse5 |c_~#stored_elements~0.base| (store (select .cse5 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_25| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1147))))) (or (= 800 (select .cse0 .cse1)) (< |v_t1Thread1of1ForFork0_~i~0#1_25| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) 0)) (not (= 800 (select (select .cse2 |c_~#queue~0.base|) .cse3))) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1139))))))) is different from false [2022-11-16 16:36:10,950 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1127 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1150 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_25| Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1131 Int) (v_ArrVal_1142 Int) (v_ArrVal_1145 Int) (v_ArrVal_1147 Int) (v_ArrVal_1137 Int) (v_ArrVal_1139 Int)) (let ((.cse5 (+ |c_~#stored_elements~0.offset| 4)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse7 (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1127))) (store .cse10 |c_~#queue~0.base| (store (store (store (select .cse10 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse8 v_ArrVal_1131) .cse4 v_ArrVal_1132))))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse3 (store (store (store .cse2 .cse8 v_ArrVal_1137) .cse1 v_ArrVal_1139) (+ (* (select .cse2 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1140))) (let ((.cse0 (let ((.cse6 (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse8 v_ArrVal_1142) .cse4 v_ArrVal_1145)))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_25| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1147))))) (or (not (= (select (select .cse0 |c_~#queue~0.base|) .cse1) 800)) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1139) (= 800 (select .cse3 .cse4)) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) .cse5) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_25| 1)))))))) is different from false [2022-11-16 16:36:11,853 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_t1Thread1of1ForFork0_empty_#t~mem31#1| |c_t1Thread1of1ForFork0_empty_#t~mem32#1|) (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1127 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1150 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_25| Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1131 Int) (v_ArrVal_1142 Int) (v_ArrVal_1145 Int) (v_ArrVal_1147 Int) (v_ArrVal_1137 Int) (v_ArrVal_1139 Int)) (let ((.cse5 (+ |c_~#stored_elements~0.offset| 4)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse7 (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1127))) (store .cse10 |c_~#queue~0.base| (store (store (store (select .cse10 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse8 v_ArrVal_1131) .cse4 v_ArrVal_1132))))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse3 (store (store (store .cse2 .cse8 v_ArrVal_1137) .cse1 v_ArrVal_1139) (+ (* (select .cse2 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1140))) (let ((.cse0 (let ((.cse6 (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse8 v_ArrVal_1142) .cse4 v_ArrVal_1145)))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_25| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1147))))) (or (not (= (select (select .cse0 |c_~#queue~0.base|) .cse1) 800)) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1139) (= 800 (select .cse3 .cse4)) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) .cse5) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_25| 1))))))))) is different from false [2022-11-16 16:36:11,967 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_t1Thread1of1ForFork0_empty_#t~mem31#1| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_empty_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_empty_~q#1.offset|))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1127 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1150 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_25| Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1131 Int) (v_ArrVal_1142 Int) (v_ArrVal_1145 Int) (v_ArrVal_1147 Int) (v_ArrVal_1137 Int) (v_ArrVal_1139 Int)) (let ((.cse5 (+ |c_~#stored_elements~0.offset| 4)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse7 (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1127))) (store .cse10 |c_~#queue~0.base| (store (store (store (select .cse10 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse8 v_ArrVal_1131) .cse4 v_ArrVal_1132))))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse3 (store (store (store .cse2 .cse8 v_ArrVal_1137) .cse1 v_ArrVal_1139) (+ (* (select .cse2 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1140))) (let ((.cse0 (let ((.cse6 (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse8 v_ArrVal_1142) .cse4 v_ArrVal_1145)))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_25| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1147))))) (or (not (= (select (select .cse0 |c_~#queue~0.base|) .cse1) 800)) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1139) (= 800 (select .cse3 .cse4)) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) .cse5) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_25| 1))))))))) is different from false [2022-11-16 16:36:12,095 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_empty_~q#1.base|))) (= (select .cse0 (+ 3204 |c_t1Thread1of1ForFork0_empty_~q#1.offset|)) (select .cse0 (+ 3200 |c_t1Thread1of1ForFork0_empty_~q#1.offset|)))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1127 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1150 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_25| Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1131 Int) (v_ArrVal_1142 Int) (v_ArrVal_1145 Int) (v_ArrVal_1147 Int) (v_ArrVal_1137 Int) (v_ArrVal_1139 Int)) (let ((.cse6 (+ |c_~#stored_elements~0.offset| 4)) (.cse9 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse8 (let ((.cse10 (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1127))) (store .cse11 |c_~#queue~0.base| (store (store (store (select .cse11 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse9 v_ArrVal_1131) .cse5 v_ArrVal_1132))))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse3 (select .cse8 |c_~#queue~0.base|))) (let ((.cse4 (store (store (store .cse3 .cse9 v_ArrVal_1137) .cse2 v_ArrVal_1139) (+ (* (select .cse3 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_1140))) (let ((.cse1 (let ((.cse7 (store .cse8 |c_~#queue~0.base| (store (store .cse4 .cse9 v_ArrVal_1142) .cse5 v_ArrVal_1145)))) (store .cse7 |c_~#stored_elements~0.base| (store (select .cse7 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_25| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1147))))) (or (not (= (select (select .cse1 |c_~#queue~0.base|) .cse2) 800)) (< (+ (select .cse3 .cse2) 1) v_ArrVal_1139) (= 800 (select .cse4 .cse5)) (not (= (select (select (store .cse1 |c_~#queue~0.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) .cse6) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_25| 1))))))))) is different from false [2022-11-16 16:36:12,321 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_empty_#in~q#1.base|))) (= (select .cse0 (+ |c_t1Thread1of1ForFork0_empty_#in~q#1.offset| 3200)) (select .cse0 (+ |c_t1Thread1of1ForFork0_empty_#in~q#1.offset| 3204)))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1127 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1150 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_25| Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1131 Int) (v_ArrVal_1142 Int) (v_ArrVal_1145 Int) (v_ArrVal_1147 Int) (v_ArrVal_1137 Int) (v_ArrVal_1139 Int)) (let ((.cse6 (+ |c_~#stored_elements~0.offset| 4)) (.cse9 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse8 (let ((.cse10 (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1127))) (store .cse11 |c_~#queue~0.base| (store (store (store (select .cse11 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse9 v_ArrVal_1131) .cse5 v_ArrVal_1132))))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse3 (select .cse8 |c_~#queue~0.base|))) (let ((.cse4 (store (store (store .cse3 .cse9 v_ArrVal_1137) .cse2 v_ArrVal_1139) (+ (* (select .cse3 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_1140))) (let ((.cse1 (let ((.cse7 (store .cse8 |c_~#queue~0.base| (store (store .cse4 .cse9 v_ArrVal_1142) .cse5 v_ArrVal_1145)))) (store .cse7 |c_~#stored_elements~0.base| (store (select .cse7 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_25| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1147))))) (or (not (= (select (select .cse1 |c_~#queue~0.base|) .cse2) 800)) (< (+ (select .cse3 .cse2) 1) v_ArrVal_1139) (= 800 (select .cse4 .cse5)) (not (= (select (select (store .cse1 |c_~#queue~0.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) .cse6) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_25| 1))))))))) is different from false [2022-11-16 16:36:12,664 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse1 (+ 3200 |c_~#queue~0.offset|))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1127 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1150 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_25| Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1131 Int) (v_ArrVal_1142 Int) (v_ArrVal_1145 Int) (v_ArrVal_1147 Int) (v_ArrVal_1137 Int) (v_ArrVal_1139 Int)) (let ((.cse5 (+ |c_~#stored_elements~0.offset| 4)) (.cse8 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse7 (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1127))) (store .cse10 |c_~#queue~0.base| (store (store (store (select .cse10 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse8 v_ArrVal_1131) .cse4 v_ArrVal_1132))))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse3 (store (store (store .cse2 .cse8 v_ArrVal_1137) .cse1 v_ArrVal_1139) (+ (* (select .cse2 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1140))) (let ((.cse0 (let ((.cse6 (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse8 v_ArrVal_1142) .cse4 v_ArrVal_1145)))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_25| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1147))))) (or (not (= (select (select .cse0 |c_~#queue~0.base|) .cse1) 800)) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1139) (= 800 (select .cse3 .cse4)) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) .cse5) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_25| 1)))))))) (let ((.cse11 (select |c_#memory_int| |c_~#queue~0.base|))) (= (select .cse11 .cse4) (select .cse11 .cse1))))) is different from false [2022-11-16 16:36:12,920 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1127 (Array Int Int)) (v_ArrVal_1126 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1150 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_25| Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1131 Int) (v_ArrVal_1142 Int) (v_ArrVal_1145 Int) (v_ArrVal_1147 Int) (v_ArrVal_1137 Int) (v_ArrVal_1139 Int)) (let ((.cse3 (+ |c_~#stored_elements~0.offset| 4)) (.cse10 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204)) (.cse6 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1126))) (let ((.cse9 (let ((.cse11 (let ((.cse12 (store .cse6 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1127))) (store .cse12 |c_~#queue~0.base| (store (store (store (select .cse12 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse10 v_ArrVal_1131) .cse5 v_ArrVal_1132))))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse0 (select .cse9 |c_~#queue~0.base|))) (let ((.cse7 (store (store (store .cse0 .cse10 v_ArrVal_1137) .cse1 v_ArrVal_1139) (+ |c_~#queue~0.offset| (* (select .cse0 .cse5) 4)) v_ArrVal_1140))) (let ((.cse2 (let ((.cse8 (store .cse9 |c_~#queue~0.base| (store (store .cse7 .cse10 v_ArrVal_1142) .cse5 v_ArrVal_1145)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_25| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1147))))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1139) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) .cse3) 0)) (let ((.cse4 (select .cse6 |c_~#queue~0.base|))) (= (select .cse4 .cse5) (select .cse4 .cse1))) (= (select .cse7 .cse5) 800) (< |v_t1Thread1of1ForFork0_~i~0#1_25| 1) (not (= (select (select .cse2 |c_~#queue~0.base|) .cse1) 800))))))))) is different from false [2022-11-16 16:36:14,188 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1127 (Array Int Int)) (v_ArrVal_1126 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1150 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_25| Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1131 Int) (v_ArrVal_1142 Int) (v_ArrVal_1145 Int) (v_ArrVal_1147 Int) (v_ArrVal_1137 Int) (v_ArrVal_1139 Int)) (let ((.cse1 (+ |c_~#stored_elements~0.offset| 4)) (.cse10 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1126))) (let ((.cse9 (let ((.cse11 (let ((.cse12 (store .cse6 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1127))) (store .cse12 |c_~#queue~0.base| (store (store (store (select .cse12 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse10 v_ArrVal_1131) .cse3 v_ArrVal_1132))))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) .cse1 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse4 (+ 3200 |c_~#queue~0.offset|)) (.cse7 (select .cse9 |c_~#queue~0.base|))) (let ((.cse2 (store (store (store .cse7 .cse10 v_ArrVal_1137) .cse4 v_ArrVal_1139) (+ |c_~#queue~0.offset| (* (select .cse7 .cse3) 4)) v_ArrVal_1140))) (let ((.cse0 (let ((.cse8 (store .cse9 |c_~#queue~0.base| (store (store .cse2 .cse10 v_ArrVal_1142) .cse3 v_ArrVal_1145)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_25| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1147))))) (or (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) .cse1) 0)) (= (select .cse2 .cse3) 800) (not (= (select (select .cse0 |c_~#queue~0.base|) .cse4) 800)) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (= (select .cse5 .cse4) (select .cse5 .cse3))) (< |v_t1Thread1of1ForFork0_~i~0#1_25| 1) (< (+ (select .cse7 .cse4) 1) v_ArrVal_1139)))))))) is different from false [2022-11-16 16:36:14,513 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1127 (Array Int Int)) (v_ArrVal_1126 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1150 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_25| Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1131 Int) (v_ArrVal_1142 Int) (v_ArrVal_1145 Int) (v_ArrVal_1147 Int) (v_ArrVal_1137 Int) (v_ArrVal_1139 Int)) (let ((.cse7 (+ |c_~#stored_elements~0.offset| 4)) (.cse10 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1126))) (let ((.cse9 (let ((.cse11 (let ((.cse12 (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1127))) (store .cse12 |c_~#queue~0.base| (store (store (store (select .cse12 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse10 v_ArrVal_1131) .cse3 v_ArrVal_1132))))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) .cse7 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse0 (select .cse9 |c_~#queue~0.base|))) (let ((.cse5 (store (store (store .cse0 .cse10 v_ArrVal_1137) .cse1 v_ArrVal_1139) (+ (* (select .cse0 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1140))) (let ((.cse6 (let ((.cse8 (store .cse9 |c_~#queue~0.base| (store (store .cse5 .cse10 v_ArrVal_1142) .cse3 v_ArrVal_1145)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_25| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1147))))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1139) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (= (select .cse2 .cse3) (select .cse2 .cse1))) (= (select .cse5 .cse3) 800) (not (= 800 (select (select .cse6 |c_~#queue~0.base|) .cse1))) (< |v_t1Thread1of1ForFork0_~i~0#1_25| 1) (not (= (select (select (store .cse6 |c_~#queue~0.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) .cse7) 0))))))))) is different from false [2022-11-16 16:36:14,867 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1127 (Array Int Int)) (v_ArrVal_1126 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1150 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_25| Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1131 Int) (v_ArrVal_1142 Int) (v_ArrVal_1145 Int) (v_ArrVal_1147 Int) (v_ArrVal_1137 Int) (v_ArrVal_1139 Int)) (let ((.cse6 (+ |c_~#stored_elements~0.offset| 4)) (.cse10 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse13 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse14 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse13 .cse14 (+ (select .cse13 .cse14) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1126))) (let ((.cse9 (let ((.cse11 (let ((.cse12 (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1127))) (store .cse12 |c_~#queue~0.base| (store (store (store (select .cse12 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse10 v_ArrVal_1131) .cse2 v_ArrVal_1132))))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse5 (select .cse9 |c_~#queue~0.base|))) (let ((.cse7 (store (store (store .cse5 .cse10 v_ArrVal_1137) .cse1 v_ArrVal_1139) (+ |c_~#queue~0.offset| (* (select .cse5 .cse2) 4)) v_ArrVal_1140))) (let ((.cse4 (let ((.cse8 (store .cse9 |c_~#queue~0.base| (store (store .cse7 .cse10 v_ArrVal_1142) .cse2 v_ArrVal_1145)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_25| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1147))))) (or (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (= (select .cse0 .cse1) (select .cse0 .cse2))) (not (= 800 (select (select .cse4 |c_~#queue~0.base|) .cse1))) (< (+ (select .cse5 .cse1) 1) v_ArrVal_1139) (not (= (select (select (store .cse4 |c_~#queue~0.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) .cse6) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_25| 1) (= (select .cse7 .cse2) 800)))))))) is different from false [2022-11-16 16:36:16,379 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_1127 (Array Int Int)) (v_ArrVal_1126 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1150 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_25| Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1131 Int) (v_ArrVal_1142 Int) (v_ArrVal_1145 Int) (v_ArrVal_1122 Int) (v_ArrVal_1147 Int) (v_ArrVal_1137 Int) (v_ArrVal_1139 Int)) (let ((.cse3 (+ |c_~#stored_elements~0.offset| 4)) (.cse10 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204)) (.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse13 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse14 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse13 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1122) .cse14 (+ (select .cse13 .cse14) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1126))) (let ((.cse9 (let ((.cse11 (let ((.cse12 (store .cse7 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1127))) (store .cse12 |c_~#queue~0.base| (store (store (store (select .cse12 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse10 v_ArrVal_1131) .cse5 v_ArrVal_1132))))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse0 (select .cse9 |c_~#queue~0.base|))) (let ((.cse4 (store (store (store .cse0 .cse10 v_ArrVal_1137) .cse1 v_ArrVal_1139) (+ (* (select .cse0 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_1140))) (let ((.cse2 (let ((.cse8 (store .cse9 |c_~#queue~0.base| (store (store .cse4 .cse10 v_ArrVal_1142) .cse5 v_ArrVal_1145)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_25| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1147))))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1139) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) .cse3) 0)) (not (= 800 (select (select .cse2 |c_~#queue~0.base|) .cse1))) (= (select .cse4 .cse5) 800) (< |v_t1Thread1of1ForFork0_~i~0#1_25| 1) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (= (select .cse6 .cse1) (select .cse6 .cse5)))))))))) is different from false [2022-11-16 16:36:17,530 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1127 (Array Int Int)) (v_ArrVal_1126 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1150 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_25| Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1120 Int) (v_ArrVal_1131 Int) (v_ArrVal_1142 Int) (v_ArrVal_1145 Int) (v_ArrVal_1122 Int) (v_ArrVal_1147 Int) (v_ArrVal_1137 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_1139 Int)) (let ((.cse7 (+ |c_~#stored_elements~0.offset| 4)) (.cse10 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse13 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1120)) (.cse14 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse13 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1122) .cse14 (+ (select .cse13 .cse14) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1126))) (let ((.cse9 (let ((.cse11 (let ((.cse12 (store .cse6 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1127))) (store .cse12 |c_~#queue~0.base| (store (store (store (select .cse12 |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|) .cse10 v_ArrVal_1131) .cse1 v_ArrVal_1132))))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) .cse7 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse3 (+ 3200 |c_~#queue~0.offset|)) (.cse2 (select .cse9 |c_~#queue~0.base|))) (let ((.cse0 (store (store (store .cse2 .cse10 v_ArrVal_1137) .cse3 v_ArrVal_1139) (+ |c_~#queue~0.offset| (* 4 (select .cse2 .cse1))) v_ArrVal_1140))) (let ((.cse4 (let ((.cse8 (store .cse9 |c_~#queue~0.base| (store (store .cse0 .cse10 v_ArrVal_1142) .cse1 v_ArrVal_1145)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_25| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1147))))) (or (= 800 (select .cse0 .cse1)) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1139) (not (= (select (select .cse4 |c_~#queue~0.base|) .cse3) 800)) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (= (select .cse5 .cse3) (select .cse5 .cse1))) (< |v_t1Thread1of1ForFork0_~i~0#1_25| 1) (not (= (select (select (store .cse4 |c_~#queue~0.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) .cse7) 0))))))))) is different from false [2022-11-16 16:36:17,875 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| Int)) (let ((.cse15 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse14 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_1127 (Array Int Int)) (v_ArrVal_1126 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1150 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_25| Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1120 Int) (v_ArrVal_1131 Int) (v_ArrVal_1142 Int) (v_ArrVal_1145 Int) (v_ArrVal_1122 Int) (v_ArrVal_1147 Int) (v_ArrVal_1137 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_1139 Int)) (let ((.cse6 (+ |c_~#stored_elements~0.offset| 4)) (.cse10 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse13 (store .cse15 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1120))) (store (store .cse13 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1122) .cse14 (+ (select .cse13 .cse14) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1126))) (let ((.cse9 (let ((.cse11 (let ((.cse12 (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1127))) (store .cse12 |c_~#queue~0.base| (store (store (store (select .cse12 |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|) .cse10 v_ArrVal_1131) .cse2 v_ArrVal_1132))))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse7 (select .cse9 |c_~#queue~0.base|))) (let ((.cse4 (store (store (store .cse7 .cse10 v_ArrVal_1137) .cse1 v_ArrVal_1139) (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1140))) (let ((.cse5 (let ((.cse8 (store .cse9 |c_~#queue~0.base| (store (store .cse4 .cse10 v_ArrVal_1142) .cse2 v_ArrVal_1145)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_25| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1147))))) (or (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (= (select .cse0 .cse1) (select .cse0 .cse2))) (= (select .cse4 .cse2) 800) (not (= (select (select (store .cse5 |c_~#queue~0.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) .cse6) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_25| 1) (< (+ (select .cse7 .cse1) 1) v_ArrVal_1139) (not (= (select (select .cse5 |c_~#queue~0.base|) .cse1) 800))))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse15 .cse14)))))) is different from false [2022-11-16 16:36:18,604 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| Int) (v_ArrVal_1127 (Array Int Int)) (v_ArrVal_1126 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1150 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_25| Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1120 Int) (v_ArrVal_1131 Int) (v_ArrVal_1142 Int) (v_ArrVal_1145 Int) (v_ArrVal_1122 Int) (v_ArrVal_1147 Int) (v_ArrVal_1137 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_1139 Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse7 (+ |c_~#stored_elements~0.offset| 4)) (.cse12 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse15 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1120))) (store (store .cse15 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1122) .cse1 (+ (select .cse15 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1126))) (let ((.cse11 (let ((.cse13 (let ((.cse14 (store .cse9 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1127))) (store .cse14 |c_~#queue~0.base| (store (store (store (select .cse14 |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|) .cse12 v_ArrVal_1131) .cse3 v_ArrVal_1132))))) (store .cse13 |c_~#stored_elements~0.base| (store (select .cse13 |c_~#stored_elements~0.base|) .cse7 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse5 (+ 3200 |c_~#queue~0.offset|)) (.cse6 (select .cse11 |c_~#queue~0.base|))) (let ((.cse2 (store (store (store .cse6 .cse12 v_ArrVal_1137) .cse5 v_ArrVal_1139) (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1140))) (let ((.cse4 (let ((.cse10 (store .cse11 |c_~#queue~0.base| (store (store .cse2 .cse12 v_ArrVal_1142) .cse3 v_ArrVal_1145)))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_25| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1147))))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse0 .cse1))) (= 800 (select .cse2 .cse3)) (not (= (select (select .cse4 |c_~#queue~0.base|) .cse5) 800)) (< (+ (select .cse6 .cse5) 1) v_ArrVal_1139) (not (= (select (select (store .cse4 |c_~#queue~0.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) .cse7) 0)) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (= (select .cse8 .cse3) (select .cse8 .cse5))) (< |v_t1Thread1of1ForFork0_~i~0#1_25| 1))))))))) is different from false [2022-11-16 16:36:19,677 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| Int) (v_ArrVal_1127 (Array Int Int)) (v_ArrVal_1126 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1150 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_25| Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1120 Int) (v_ArrVal_1131 Int) (v_ArrVal_1142 Int) (v_ArrVal_1145 Int) (v_ArrVal_1122 Int) (v_ArrVal_1147 Int) (v_ArrVal_1137 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_1139 Int)) (let ((.cse11 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse8 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse7 (+ |c_~#stored_elements~0.offset| 4)) (.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse14 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_1120))) (store (store .cse14 .cse11 v_ArrVal_1122) .cse3 (+ (select .cse14 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1126))) (let ((.cse10 (let ((.cse12 (let ((.cse13 (store .cse6 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1127))) (store .cse13 |c_~#queue~0.base| (store (store (store (select .cse13 |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|) .cse11 v_ArrVal_1131) .cse3 v_ArrVal_1132))))) (store .cse12 |c_~#stored_elements~0.base| (store (select .cse12 |c_~#stored_elements~0.base|) .cse7 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse4 (select .cse10 |c_~#queue~0.base|))) (let ((.cse2 (store (store (store .cse4 .cse11 v_ArrVal_1137) .cse1 v_ArrVal_1139) (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1140))) (let ((.cse0 (let ((.cse9 (store .cse10 |c_~#queue~0.base| (store (store .cse2 .cse11 v_ArrVal_1142) .cse3 v_ArrVal_1145)))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_25| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1147))))) (or (not (= 800 (select (select .cse0 |c_~#queue~0.base|) .cse1))) (= (select .cse2 .cse3) 800) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1139) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (= (select .cse5 .cse1) (select .cse5 .cse3))) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) .cse7) 0)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse8 .cse3))) (< |v_t1Thread1of1ForFork0_~i~0#1_25| 1))))))))) is different from false [2022-11-16 16:36:22,693 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1119 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| Int) (v_ArrVal_1127 (Array Int Int)) (v_ArrVal_1126 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1150 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_25| Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1120 Int) (v_ArrVal_1131 Int) (v_ArrVal_1142 Int) (v_ArrVal_1145 Int) (v_ArrVal_1122 Int) (v_ArrVal_1147 Int) (v_ArrVal_1137 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_1139 Int)) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1119))) (let ((.cse11 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse8 (select .cse14 |c_~#queue~0.base|))) (let ((.cse2 (+ |c_~#stored_elements~0.offset| 4)) (.cse5 (store (store .cse14 |c_~#queue~0.base| (let ((.cse15 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_1120))) (store (store .cse15 .cse11 v_ArrVal_1122) .cse4 (+ (select .cse15 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1126))) (let ((.cse10 (let ((.cse12 (let ((.cse13 (store .cse5 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1127))) (store .cse13 |c_~#queue~0.base| (store (store (store (select .cse13 |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|) .cse11 v_ArrVal_1131) .cse4 v_ArrVal_1132))))) (store .cse12 |c_~#stored_elements~0.base| (store (select .cse12 |c_~#stored_elements~0.base|) .cse2 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse6 (select .cse10 |c_~#queue~0.base|))) (let ((.cse7 (store (store (store .cse6 .cse11 v_ArrVal_1137) .cse1 v_ArrVal_1139) (+ |c_~#queue~0.offset| (* (select .cse6 .cse4) 4)) v_ArrVal_1140))) (let ((.cse0 (let ((.cse9 (store .cse10 |c_~#queue~0.base| (store (store .cse7 .cse11 v_ArrVal_1142) .cse4 v_ArrVal_1145)))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_25| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1147))))) (or (not (= (select (select .cse0 |c_~#queue~0.base|) .cse1) 800)) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) .cse2) 0)) (let ((.cse3 (select .cse5 |c_~#queue~0.base|))) (= (select .cse3 .cse4) (select .cse3 .cse1))) (< (+ (select .cse6 .cse1) 1) v_ArrVal_1139) (= 800 (select .cse7 .cse4)) (< |v_t1Thread1of1ForFork0_~i~0#1_25| 1) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse8 .cse4)))))))))))) is different from false [2022-11-16 16:36:36,699 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1119 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| Int) (v_ArrVal_1127 (Array Int Int)) (v_ArrVal_1126 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_1150 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_25| Int) (v_ArrVal_1140 Int) (v_ArrVal_1132 Int) (v_ArrVal_1120 Int) (v_ArrVal_1131 Int) (v_ArrVal_1142 Int) (v_ArrVal_1145 Int) (v_ArrVal_1122 Int) (v_ArrVal_1147 Int) (v_ArrVal_1137 Int) (v_ArrVal_1117 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_1139 Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_1117)))) (let ((.cse16 (store .cse9 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1119))) (let ((.cse13 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse10 (select .cse16 |c_~#queue~0.base|))) (let ((.cse1 (+ |c_~#stored_elements~0.offset| 4)) (.cse5 (store (store .cse16 |c_~#queue~0.base| (let ((.cse17 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40|) |c_~#queue~0.offset|) v_ArrVal_1120))) (store (store .cse17 .cse13 v_ArrVal_1122) .cse3 (+ (select .cse17 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1126))) (let ((.cse12 (let ((.cse14 (let ((.cse15 (store .cse5 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1127))) (store .cse15 |c_~#queue~0.base| (store (store (store (select .cse15 |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|) .cse13 v_ArrVal_1131) .cse3 v_ArrVal_1132))))) (store .cse14 |c_~#stored_elements~0.base| (store (select .cse14 |c_~#stored_elements~0.base|) .cse1 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse4 (+ 3200 |c_~#queue~0.offset|)) (.cse7 (select .cse12 |c_~#queue~0.base|))) (let ((.cse6 (store (store (store .cse7 .cse13 v_ArrVal_1137) .cse4 v_ArrVal_1139) (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1140))) (let ((.cse0 (let ((.cse11 (store .cse12 |c_~#queue~0.base| (store (store .cse6 .cse13 v_ArrVal_1142) .cse3 v_ArrVal_1145)))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_25| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_1147))))) (or (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_1150) |c_~#stored_elements~0.base|) .cse1) 0)) (let ((.cse2 (select .cse5 |c_~#queue~0.base|))) (= (select .cse2 .cse3) (select .cse2 .cse4))) (= (select .cse6 .cse3) 800) (not (= 800 (select (select .cse0 |c_~#queue~0.base|) .cse4))) (< (+ (select .cse7 .cse4) 1) v_ArrVal_1139) (not (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (= (select .cse8 .cse4) (select .cse8 .cse3)))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_40| (select .cse10 .cse3))) (< |v_t1Thread1of1ForFork0_~i~0#1_25| 1))))))))))) is different from false [2022-11-16 16:36:39,057 INFO L321 Elim1Store]: treesize reduction 96, result has 47.0 percent of original size [2022-11-16 16:36:39,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 8748 treesize of output 5835 [2022-11-16 16:36:40,487 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 16:36:40,489 INFO L350 Elim1Store]: Elim1 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 75066 treesize of output 74142 [2022-11-16 16:36:40,639 INFO L173 IndexEqualityManager]: detected equality via solver