/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.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE --traceabstraction.maximal.amount.of.steps.the.threads.are.allowed.to.take.successively 1 --traceabstraction.enable.heuristic.with.loops.as.step.type false --traceabstraction.considered.threads.and.their.maximal.amount.of.steps '"3,2 1,1 2,2"' --traceabstraction.defines.what.statements.are.considered.a.step.in.por ALL_READ_WRITE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_longer.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-218013a [2023-05-04 04:30:41,716 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-04 04:30:41,718 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-04 04:30:41,753 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-04 04:30:41,754 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-04 04:30:41,757 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-04 04:30:41,760 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-04 04:30:41,764 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-04 04:30:41,765 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-04 04:30:41,770 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-04 04:30:41,770 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-04 04:30:41,772 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-04 04:30:41,772 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-04 04:30:41,774 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-04 04:30:41,776 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-04 04:30:41,777 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-04 04:30:41,777 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-04 04:30:41,778 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-04 04:30:41,780 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-04 04:30:41,785 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-04 04:30:41,786 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-04 04:30:41,787 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-04 04:30:41,789 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-04 04:30:41,790 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-04 04:30:41,796 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-04 04:30:41,796 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-04 04:30:41,797 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-04 04:30:41,798 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-04 04:30:41,799 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-04 04:30:41,800 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-04 04:30:41,800 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-04 04:30:41,801 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-04 04:30:41,802 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-04 04:30:41,803 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-04 04:30:41,804 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-04 04:30:41,804 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-04 04:30:41,805 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-04 04:30:41,805 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-04 04:30:41,805 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-04 04:30:41,805 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-04 04:30:41,806 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-04 04:30:41,807 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-04 04:30:41,842 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-04 04:30:41,842 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-04 04:30:41,843 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-04 04:30:41,843 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-04 04:30:41,844 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-04 04:30:41,844 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-04 04:30:41,845 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-04 04:30:41,845 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-04 04:30:41,845 INFO L138 SettingsManager]: * Use SBE=true [2023-05-04 04:30:41,845 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-04 04:30:41,846 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-04 04:30:41,846 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-04 04:30:41,846 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-04 04:30:41,846 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-04 04:30:41,847 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-04 04:30:41,847 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-04 04:30:41,847 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-04 04:30:41,847 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-04 04:30:41,847 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-04 04:30:41,847 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-04 04:30:41,847 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-04 04:30:41,847 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-04 04:30:41,848 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-04 04:30:41,848 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-04 04:30:41,848 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-04 04:30:41,848 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 04:30:41,848 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-04 04:30:41,849 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-04 04:30:41,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-04 04:30:41,849 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-04 04:30:41,850 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-04 04:30:41,850 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-04 04:30:41,850 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-04 04:30:41,850 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-04 04:30:41,850 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-04 04:30:41,850 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-04 04:30:41,850 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: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Maximal amount of steps the threads are allowed to take successively -> 1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Enable heuristic with loops as step type -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Considered threads and their maximal amount of steps -> 3,2 1,1 2,2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Defines what statements are considered a step in POR -> ALL_READ_WRITE [2023-05-04 04:30:42,095 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-04 04:30:42,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-04 04:30:42,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-04 04:30:42,116 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-04 04:30:42,117 INFO L275 PluginConnector]: CDTParser initialized [2023-05-04 04:30:42,118 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_longer.i [2023-05-04 04:30:42,168 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9104e7956/fd6d9e579a9f4ebbb89d019af3b116fb/FLAG6bb6c101e [2023-05-04 04:30:42,679 INFO L306 CDTParser]: Found 1 translation units. [2023-05-04 04:30:42,680 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i [2023-05-04 04:30:42,696 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9104e7956/fd6d9e579a9f4ebbb89d019af3b116fb/FLAG6bb6c101e [2023-05-04 04:30:42,997 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9104e7956/fd6d9e579a9f4ebbb89d019af3b116fb [2023-05-04 04:30:43,000 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-04 04:30:43,001 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-04 04:30:43,002 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-04 04:30:43,002 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-04 04:30:43,007 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-04 04:30:43,008 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 04:30:42" (1/1) ... [2023-05-04 04:30:43,009 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1878af8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:30:43, skipping insertion in model container [2023-05-04 04:30:43,009 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 04:30:42" (1/1) ... [2023-05-04 04:30:43,014 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-04 04:30:43,055 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-04 04:30:43,481 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43296,43309] [2023-05-04 04:30:43,493 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43503,43516] [2023-05-04 04:30:43,495 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43783,43796] [2023-05-04 04:30:43,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 04:30:43,511 INFO L203 MainTranslator]: Completed pre-run [2023-05-04 04:30:43,556 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43296,43309] [2023-05-04 04:30:43,568 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43503,43516] [2023-05-04 04:30:43,574 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43783,43796] [2023-05-04 04:30:43,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 04:30:43,641 INFO L208 MainTranslator]: Completed translation [2023-05-04 04:30:43,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:30:43 WrapperNode [2023-05-04 04:30:43,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-04 04:30:43,643 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-04 04:30:43,643 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-04 04:30:43,643 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-04 04:30:43,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:30:43" (1/1) ... [2023-05-04 04:30:43,681 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:30:43" (1/1) ... [2023-05-04 04:30:43,716 INFO L138 Inliner]: procedures = 274, calls = 62, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 243 [2023-05-04 04:30:43,717 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-04 04:30:43,717 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-04 04:30:43,717 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-04 04:30:43,718 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-04 04:30:43,725 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:30:43" (1/1) ... [2023-05-04 04:30:43,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:30:43" (1/1) ... [2023-05-04 04:30:43,742 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:30:43" (1/1) ... [2023-05-04 04:30:43,742 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:30:43" (1/1) ... [2023-05-04 04:30:43,750 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:30:43" (1/1) ... [2023-05-04 04:30:43,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:30:43" (1/1) ... [2023-05-04 04:30:43,768 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:30:43" (1/1) ... [2023-05-04 04:30:43,770 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:30:43" (1/1) ... [2023-05-04 04:30:43,772 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-04 04:30:43,773 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-04 04:30:43,773 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-04 04:30:43,773 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-04 04:30:43,781 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:30:43" (1/1) ... [2023-05-04 04:30:43,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 04:30:43,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 04:30:43,813 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) [2023-05-04 04:30:43,817 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 [2023-05-04 04:30:43,849 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-05-04 04:30:43,849 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-05-04 04:30:43,849 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-05-04 04:30:43,849 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-05-04 04:30:43,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-04 04:30:43,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-04 04:30:43,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-04 04:30:43,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-04 04:30:43,851 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-05-04 04:30:43,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-04 04:30:43,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-04 04:30:43,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-04 04:30:43,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-04 04:30:43,853 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-04 04:30:44,006 INFO L235 CfgBuilder]: Building ICFG [2023-05-04 04:30:44,008 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-04 04:30:44,308 INFO L276 CfgBuilder]: Performing block encoding [2023-05-04 04:30:44,317 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-04 04:30:44,318 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-05-04 04:30:44,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 04:30:44 BoogieIcfgContainer [2023-05-04 04:30:44,320 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-04 04:30:44,323 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-04 04:30:44,323 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-04 04:30:44,326 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-04 04:30:44,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 04:30:42" (1/3) ... [2023-05-04 04:30:44,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f63428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 04:30:44, skipping insertion in model container [2023-05-04 04:30:44,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:30:43" (2/3) ... [2023-05-04 04:30:44,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f63428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 04:30:44, skipping insertion in model container [2023-05-04 04:30:44,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 04:30:44" (3/3) ... [2023-05-04 04:30:44,329 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2023-05-04 04:30:44,336 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-04 04:30:44,345 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-04 04:30:44,345 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-05-04 04:30:44,345 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-04 04:30:44,466 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-05-04 04:30:44,522 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 04:30:44,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 04:30:44,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 04:30:44,525 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) [2023-05-04 04:30:44,529 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 [2023-05-04 04:30:44,555 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 04:30:44,572 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2023-05-04 04:30:44,578 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;@27f49323, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 04:30:44,579 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-04 04:30:44,942 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:30:44,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:30:44,949 INFO L85 PathProgramCache]: Analyzing trace with hash 215206652, now seen corresponding path program 1 times [2023-05-04 04:30:44,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:30:44,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202024723] [2023-05-04 04:30:44,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:30:44,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:30:45,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:30:46,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 04:30:46,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:30:46,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202024723] [2023-05-04 04:30:46,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202024723] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 04:30:46,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 04:30:46,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-05-04 04:30:46,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694719511] [2023-05-04 04:30:46,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 04:30:46,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-05-04 04:30:46,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:30:46,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-05-04 04:30:46,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-05-04 04:30:46,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:30:46,354 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:30:46,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.416666666666666) internal successors, (161), 12 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) [2023-05-04 04:30:46,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:30:46,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:30:46,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-04 04:30:46,779 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:30:46,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:30:46,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1274971090, now seen corresponding path program 1 times [2023-05-04 04:30:46,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:30:46,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714896232] [2023-05-04 04:30:46,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:30:46,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:30:46,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:30:47,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 04:30:47,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:30:47,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714896232] [2023-05-04 04:30:47,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714896232] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 04:30:47,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 04:30:47,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 04:30:47,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783278092] [2023-05-04 04:30:47,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 04:30:47,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 04:30:47,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:30:47,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 04:30:47,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 04:30:47,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:30:47,005 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:30:47,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 04:30:47,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:30:47,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:30:47,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:30:47,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:30:47,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-04 04:30:47,074 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:30:47,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:30:47,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1662794902, now seen corresponding path program 1 times [2023-05-04 04:30:47,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:30:47,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199550411] [2023-05-04 04:30:47,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:30:47,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:30:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:30:47,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 04:30:47,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:30:47,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199550411] [2023-05-04 04:30:47,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199550411] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 04:30:47,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 04:30:47,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-05-04 04:30:47,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929121153] [2023-05-04 04:30:47,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 04:30:47,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-05-04 04:30:47,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:30:47,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-05-04 04:30:47,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-05-04 04:30:47,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:30:47,186 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:30:47,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 04:30:47,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:30:47,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:30:47,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:30:47,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:30:47,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:30:47,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:30:47,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-05-04 04:30:47,219 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:30:47,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:30:47,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1133987975, now seen corresponding path program 1 times [2023-05-04 04:30:47,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:30:47,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963822266] [2023-05-04 04:30:47,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:30:47,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:30:47,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:30:55,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 04:30:55,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:30:55,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963822266] [2023-05-04 04:30:55,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963822266] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 04:30:55,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 04:30:55,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2023-05-04 04:30:55,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682065410] [2023-05-04 04:30:55,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 04:30:55,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-05-04 04:30:55,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:30:55,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-05-04 04:30:55,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2023-05-04 04:30:55,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:30:55,759 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:30:55,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.517241379310345) internal successors, (131), 29 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 04:30:55,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:30:55,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:30:55,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:30:55,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:30:58,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:30:58,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:30:58,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:30:58,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-05-04 04:30:58,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-05-04 04:30:58,969 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:30:58,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:30:58,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1285883828, now seen corresponding path program 1 times [2023-05-04 04:30:58,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:30:58,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544735575] [2023-05-04 04:30:58,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:30:58,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:30:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:30:59,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 04:30:59,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:30:59,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544735575] [2023-05-04 04:30:59,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544735575] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 04:30:59,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 04:30:59,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-05-04 04:30:59,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547761571] [2023-05-04 04:30:59,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 04:30:59,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-05-04 04:30:59,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:30:59,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-05-04 04:30:59,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-05-04 04:30:59,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:30:59,034 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:30:59,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 04:30:59,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:30:59,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:30:59,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:30:59,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-05-04 04:30:59,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:31:00,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:31:00,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:31:00,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:31:00,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-05-04 04:31:00,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:31:00,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-05-04 04:31:00,935 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:31:00,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:31:00,936 INFO L85 PathProgramCache]: Analyzing trace with hash -152943195, now seen corresponding path program 2 times [2023-05-04 04:31:00,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:31:00,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626603844] [2023-05-04 04:31:00,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:31:00,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:31:00,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:31:04,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 04:31:04,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:31:04,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626603844] [2023-05-04 04:31:04,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626603844] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 04:31:04,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 04:31:04,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2023-05-04 04:31:04,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893250949] [2023-05-04 04:31:04,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 04:31:04,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-05-04 04:31:04,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:31:04,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-05-04 04:31:04,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2023-05-04 04:31:04,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:31:04,040 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:31:04,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.678571428571429) internal successors, (131), 28 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 04:31:04,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:31:04,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:31:04,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:31:04,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2023-05-04 04:31:04,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:31:04,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:31:07,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:31:07,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:31:07,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:31:07,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-05-04 04:31:07,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:31:07,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 04:31:07,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-05-04 04:31:07,335 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:31:07,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:31:07,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1358128959, now seen corresponding path program 1 times [2023-05-04 04:31:07,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:31:07,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964145394] [2023-05-04 04:31:07,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:31:07,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:31:07,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:31:07,392 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 04:31:07,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:31:07,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964145394] [2023-05-04 04:31:07,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964145394] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 04:31:07,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 04:31:07,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 04:31:07,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451096124] [2023-05-04 04:31:07,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 04:31:07,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 04:31:07,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:31:07,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 04:31:07,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 04:31:07,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:31:07,398 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:31:07,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 04:31:07,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:31:07,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:31:07,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:31:07,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2023-05-04 04:31:07,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:31:07,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 04:31:07,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:31:07,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:31:07,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:31:07,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:31:07,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-05-04 04:31:07,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:31:07,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 04:31:07,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:31:07,588 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-05-04 04:31:07,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-05-04 04:31:07,598 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2023-05-04 04:31:07,599 INFO L307 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork0 was SAFE (1/3) [2023-05-04 04:31:07,605 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 04:31:07,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 04:31:07,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 04:31:07,613 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) [2023-05-04 04:31:07,613 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 [2023-05-04 04:31:07,616 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 04:31:07,617 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-04 04:31:07,618 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;@27f49323, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 04:31:07,618 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-05-04 04:31:07,818 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 04:31:07,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:31:07,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1422695656, now seen corresponding path program 1 times [2023-05-04 04:31:07,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:31:07,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846424228] [2023-05-04 04:31:07,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:31:07,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:31:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:31:07,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 04:31:07,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:31:07,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846424228] [2023-05-04 04:31:07,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846424228] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 04:31:07,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 04:31:07,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-04 04:31:07,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648958353] [2023-05-04 04:31:07,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 04:31:07,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-04 04:31:07,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:31:07,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-04 04:31:07,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-04 04:31:07,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:31:07,837 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:31:07,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 04:31:07,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:31:07,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:31:07,845 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-05-04 04:31:07,845 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-05-04 04:31:07,846 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-05-04 04:31:07,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-05-04 04:31:07,850 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2023-05-04 04:31:07,850 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE,SAFE (2/3) [2023-05-04 04:31:07,853 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 04:31:07,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 04:31:07,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 04:31:07,906 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) [2023-05-04 04:31:07,909 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 04:31:07,910 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork1 ======== [2023-05-04 04:31:07,911 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;@27f49323, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 04:31:07,911 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-04 04:31:07,931 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 [2023-05-04 04:31:08,016 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:31:08,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:31:08,016 INFO L85 PathProgramCache]: Analyzing trace with hash 623107423, now seen corresponding path program 1 times [2023-05-04 04:31:08,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:31:08,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413599135] [2023-05-04 04:31:08,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:31:08,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:31:08,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:31:08,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 04:31:08,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:31:08,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413599135] [2023-05-04 04:31:08,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413599135] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 04:31:08,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 04:31:08,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-05-04 04:31:08,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657826916] [2023-05-04 04:31:08,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 04:31:08,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-05-04 04:31:08,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:31:08,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-05-04 04:31:08,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-05-04 04:31:08,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:31:08,392 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:31:08,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.916666666666666) internal successors, (131), 12 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 04:31:08,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:31:08,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:31:08,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-05-04 04:31:08,666 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:31:08,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:31:08,666 INFO L85 PathProgramCache]: Analyzing trace with hash 175723025, now seen corresponding path program 1 times [2023-05-04 04:31:08,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:31:08,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798099101] [2023-05-04 04:31:08,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:31:08,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:31:08,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:31:08,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 04:31:08,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:31:08,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798099101] [2023-05-04 04:31:08,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798099101] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 04:31:08,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 04:31:08,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 04:31:08,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846838662] [2023-05-04 04:31:08,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 04:31:08,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 04:31:08,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:31:08,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 04:31:08,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 04:31:08,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:31:08,757 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:31:08,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 04:31:08,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:31:08,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:31:08,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:31:08,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:31:08,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-05-04 04:31:08,888 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:31:08,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:31:08,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1360987719, now seen corresponding path program 1 times [2023-05-04 04:31:08,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:31:08,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568911117] [2023-05-04 04:31:08,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:31:08,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:31:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:31:09,025 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 04:31:09,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:31:09,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568911117] [2023-05-04 04:31:09,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568911117] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 04:31:09,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600283560] [2023-05-04 04:31:09,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:31:09,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 04:31:09,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 04:31:09,035 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) [2023-05-04 04:31:09,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-05-04 04:31:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:31:09,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-04 04:31:09,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 04:31:09,334 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 04:31:09,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 04:31:09,439 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 04:31:09,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600283560] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 04:31:09,439 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 04:31:09,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-04 04:31:09,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550651462] [2023-05-04 04:31:09,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 04:31:09,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-04 04:31:09,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:31:09,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-04 04:31:09,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-04 04:31:09,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:31:09,441 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:31:09,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 31.9) internal successors, (319), 10 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 04:31:09,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:31:09,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:31:09,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:31:09,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:31:09,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:31:09,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 04:31:09,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-05-04 04:31:09,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 04:31:09,728 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:31:09,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:31:09,728 INFO L85 PathProgramCache]: Analyzing trace with hash -781158759, now seen corresponding path program 2 times [2023-05-04 04:31:09,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:31:09,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413903024] [2023-05-04 04:31:09,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:31:09,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:31:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:31:10,109 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 69 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 04:31:10,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:31:10,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413903024] [2023-05-04 04:31:10,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413903024] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 04:31:10,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221072675] [2023-05-04 04:31:10,110 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 04:31:10,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 04:31:10,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 04:31:10,112 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) [2023-05-04 04:31:10,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-05-04 04:31:10,344 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 04:31:10,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 04:31:10,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-04 04:31:10,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 04:31:10,560 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 69 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 04:31:10,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 04:31:10,776 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 69 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 04:31:10,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221072675] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 04:31:10,777 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 04:31:10,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-05-04 04:31:10,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874742158] [2023-05-04 04:31:10,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 04:31:10,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-05-04 04:31:10,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:31:10,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-05-04 04:31:10,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-05-04 04:31:10,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:31:10,779 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:31:10,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 27.944444444444443) internal successors, (503), 18 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 04:31:10,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:31:10,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:31:10,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 04:31:10,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:31:10,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:31:10,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:31:10,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 04:31:10,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 04:31:10,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-05-04 04:31:11,177 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,SelfDestructingSolverStorable11 [2023-05-04 04:31:11,177 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:31:11,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:31:11,178 INFO L85 PathProgramCache]: Analyzing trace with hash 184827993, now seen corresponding path program 3 times [2023-05-04 04:31:11,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:31:11,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723885673] [2023-05-04 04:31:11,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:31:11,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:31:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:31:11,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1183 backedges. 161 proven. 1022 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 04:31:11,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:31:11,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723885673] [2023-05-04 04:31:11,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723885673] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 04:31:11,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353774507] [2023-05-04 04:31:11,972 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-04 04:31:11,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 04:31:11,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 04:31:11,974 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) [2023-05-04 04:31:11,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-05-04 04:31:12,220 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-05-04 04:31:12,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 04:31:12,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 38 conjunts are in the unsatisfiable core [2023-05-04 04:31:12,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 04:31:13,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-05-04 04:31:13,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-05-04 04:31:13,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-05-04 04:31:13,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1183 backedges. 336 proven. 131 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2023-05-04 04:31:13,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 04:31:13,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2023-05-04 04:31:13,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1183 backedges. 448 proven. 19 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2023-05-04 04:31:13,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353774507] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 04:31:13,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 04:31:13,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 8] total 32 [2023-05-04 04:31:13,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232958745] [2023-05-04 04:31:13,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 04:31:13,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-05-04 04:31:13,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:31:13,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-05-04 04:31:13,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=871, Unknown=0, NotChecked=0, Total=992 [2023-05-04 04:31:13,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:31:13,999 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:31:13,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 26.09375) internal successors, (835), 32 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 04:31:14,000 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:31:14,000 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:31:14,000 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 04:31:14,000 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 04:31:14,000 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:31:16,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:31:16,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:31:16,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 04:31:16,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 04:31:16,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-05-04 04:31:16,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-05-04 04:31:17,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 04:31:17,141 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:31:17,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:31:17,141 INFO L85 PathProgramCache]: Analyzing trace with hash 311879572, now seen corresponding path program 1 times [2023-05-04 04:31:17,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:31:17,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779993166] [2023-05-04 04:31:17,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:31:17,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:31:17,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:31:17,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2750 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 2706 trivial. 0 not checked. [2023-05-04 04:31:17,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:31:17,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779993166] [2023-05-04 04:31:17,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779993166] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 04:31:17,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 04:31:17,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 04:31:17,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147606507] [2023-05-04 04:31:17,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 04:31:17,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 04:31:17,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:31:17,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 04:31:17,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 04:31:17,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:31:17,644 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:31:17,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 04:31:17,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:31:17,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:31:17,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 04:31:17,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 04:31:17,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2023-05-04 04:31:17,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:31:18,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:31:18,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:31:18,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 04:31:18,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 04:31:18,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2023-05-04 04:31:18,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:31:18,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-05-04 04:31:18,485 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:31:18,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:31:18,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1640010320, now seen corresponding path program 1 times [2023-05-04 04:31:18,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:31:18,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264325208] [2023-05-04 04:31:18,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:31:18,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:31:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:31:18,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2009 backedges. 675 proven. 0 refuted. 0 times theorem prover too weak. 1334 trivial. 0 not checked. [2023-05-04 04:31:18,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:31:18,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264325208] [2023-05-04 04:31:18,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264325208] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 04:31:18,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 04:31:18,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 04:31:18,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501809712] [2023-05-04 04:31:18,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 04:31:18,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 04:31:18,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:31:18,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 04:31:18,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 04:31:18,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:31:18,695 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:31:18,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 04:31:18,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:31:18,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:31:18,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 04:31:18,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 04:31:18,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 88 states. [2023-05-04 04:31:18,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:31:18,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:31:19,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:31:19,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:31:19,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 04:31:19,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 04:31:19,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2023-05-04 04:31:19,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:31:19,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:31:19,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-05-04 04:31:19,948 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:31:19,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:31:19,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1086958796, now seen corresponding path program 1 times [2023-05-04 04:31:19,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:31:19,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745169938] [2023-05-04 04:31:19,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:31:19,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:31:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:31:30,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2832 backedges. 1978 proven. 86 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2023-05-04 04:31:30,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:31:30,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745169938] [2023-05-04 04:31:30,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745169938] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 04:31:30,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270808726] [2023-05-04 04:31:30,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:31:30,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 04:31:30,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 04:31:30,013 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 04:31:30,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-05-04 04:31:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:31:30,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 1786 conjuncts, 61 conjunts are in the unsatisfiable core [2023-05-04 04:31:30,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 04:31:32,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-05-04 04:31:33,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:31:33,018 INFO L356 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2023-05-04 04:31:33,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 48 [2023-05-04 04:31:33,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:31:33,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:31:33,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 41 [2023-05-04 04:31:33,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2023-05-04 04:31:33,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:31:33,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-05-04 04:31:33,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-05-04 04:31:33,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-05-04 04:31:33,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2832 backedges. 1767 proven. 147 refuted. 0 times theorem prover too weak. 918 trivial. 0 not checked. [2023-05-04 04:31:33,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 04:31:34,873 INFO L356 Elim1Store]: treesize reduction 233, result has 45.2 percent of original size [2023-05-04 04:31:34,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 210 treesize of output 356 [2023-05-04 04:31:34,965 INFO L356 Elim1Store]: treesize reduction 57, result has 36.7 percent of original size [2023-05-04 04:31:34,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 432 treesize of output 534 [2023-05-04 04:31:34,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 68 [2023-05-04 04:31:35,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-05-04 04:31:35,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 98 [2023-05-04 04:31:35,266 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:31:35,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 84 [2023-05-04 04:31:35,334 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-05-04 04:31:35,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 184 [2023-05-04 04:31:35,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 67 [2023-05-04 04:31:35,420 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:31:35,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 134 treesize of output 184 [2023-05-04 04:31:36,284 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:31:36,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 199 treesize of output 201 [2023-05-04 04:31:37,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2832 backedges. 1567 proven. 320 refuted. 0 times theorem prover too weak. 945 trivial. 0 not checked. [2023-05-04 04:31:37,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270808726] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 04:31:37,155 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 04:31:37,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 19] total 57 [2023-05-04 04:31:37,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497840193] [2023-05-04 04:31:37,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 04:31:37,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-05-04 04:31:37,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:31:37,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-05-04 04:31:37,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=2744, Unknown=27, NotChecked=0, Total=3192 [2023-05-04 04:31:37,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:31:37,161 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:31:37,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 17.894736842105264) internal successors, (1020), 57 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 04:31:37,162 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:31:37,162 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:31:37,162 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 04:31:37,162 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 04:31:37,162 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 114 states. [2023-05-04 04:31:37,162 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:31:37,162 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:31:37,162 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:31:38,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:31:38,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:31:38,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 04:31:38,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 04:31:38,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2023-05-04 04:31:38,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:31:38,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:31:38,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-05-04 04:31:38,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-05-04 04:31:39,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 04:31:39,093 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:31:39,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:31:39,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1968058577, now seen corresponding path program 1 times [2023-05-04 04:31:39,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:31:39,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573872534] [2023-05-04 04:31:39,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:31:39,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:31:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:32:14,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3531 backedges. 1703 proven. 1516 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-05-04 04:32:14,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:32:14,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573872534] [2023-05-04 04:32:14,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573872534] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 04:32:14,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434398131] [2023-05-04 04:32:14,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:32:14,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 04:32:14,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 04:32:14,725 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 04:32:14,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-05-04 04:32:15,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:32:15,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 1973 conjuncts, 101 conjunts are in the unsatisfiable core [2023-05-04 04:32:15,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 04:32:15,378 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-05-04 04:32:15,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2023-05-04 04:32:15,434 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 04:32:15,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 04:32:15,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-05-04 04:32:15,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-05-04 04:32:16,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2023-05-04 04:32:16,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2023-05-04 04:32:17,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:32:17,125 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 04:32:17,140 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-05-04 04:32:17,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2023-05-04 04:32:17,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:32:17,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:32:17,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2023-05-04 04:32:17,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2023-05-04 04:32:17,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:32:17,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2023-05-04 04:32:18,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:32:18,137 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 04:32:18,153 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-05-04 04:32:18,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 39 [2023-05-04 04:32:18,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:32:18,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:32:18,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 34 [2023-05-04 04:32:18,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-05-04 04:32:18,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:32:18,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-05-04 04:32:18,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:32:18,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-05-04 04:32:18,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-05-04 04:32:18,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3531 backedges. 644 proven. 5 refuted. 0 times theorem prover too weak. 2882 trivial. 0 not checked. [2023-05-04 04:32:18,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 04:32:18,938 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2038 (Array Int Int))) (not (= 400 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2038) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|))))) is different from false [2023-05-04 04:32:20,355 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2030 Int) (v_ArrVal_2034 Int) (v_ArrVal_2033 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_2036 Int) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2031 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_2030)) |c_~#stored_elements~0.base| v_ArrVal_2031))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| (select .cse0 .cse1))) (not (<= v_ArrVal_2030 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (not (= 400 (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_2033) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2034) .cse1 v_ArrVal_2036)) |c_~#stored_elements~0.base| v_ArrVal_2038) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))))))) is different from false [2023-05-04 04:32:20,375 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2030 Int) (v_ArrVal_2034 Int) (v_ArrVal_2033 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_2036 Int) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2031 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_2030)) |c_~#stored_elements~0.base| v_ArrVal_2031))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_2030) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| (select .cse0 .cse1))) (not (= 400 (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_2033) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2034) .cse1 v_ArrVal_2036)) |c_~#stored_elements~0.base| v_ArrVal_2038) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))))))) is different from false [2023-05-04 04:32:20,394 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2030 Int) (v_ArrVal_2034 Int) (v_ArrVal_2033 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_2036 Int) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2031 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_2030)) |c_~#stored_elements~0.base| v_ArrVal_2031))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2030) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| (select .cse2 .cse3))) (not (= 400 (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_2033) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2034) .cse3 v_ArrVal_2036)) |c_~#stored_elements~0.base| v_ArrVal_2038) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|))))))))) is different from false [2023-05-04 04:32:20,490 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2030 Int) (v_ArrVal_2034 Int) (v_ArrVal_2033 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_2036 Int) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2027 Int) (v_ArrVal_2031 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2027) .cse3 v_ArrVal_2030)) |c_~#stored_elements~0.base| v_ArrVal_2031))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2030) (not (= 400 (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_2033) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2034) .cse1 v_ArrVal_2036)) |c_~#stored_elements~0.base| v_ArrVal_2038) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|))))))))) is different from false [2023-05-04 04:32:20,568 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2030 Int) (v_ArrVal_2034 Int) (v_ArrVal_2033 Int) (v_ArrVal_2025 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_2036 Int) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2027 Int) (v_ArrVal_2031 (Array Int Int))) (let ((.cse3 (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_2025)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2027) .cse4 v_ArrVal_2030)) |c_~#stored_elements~0.base| v_ArrVal_2031))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_2033) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2034) .cse2 v_ArrVal_2036)) |c_~#stored_elements~0.base| v_ArrVal_2038) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| (select .cse1 .cse2))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_2030)))))) is different from false [2023-05-04 04:32:20,602 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81| Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (forall ((v_ArrVal_2030 Int) (v_ArrVal_2034 Int) (v_ArrVal_2033 Int) (v_ArrVal_2025 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_2036 Int) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2027 Int) (v_ArrVal_2031 (Array Int Int))) (let ((.cse0 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2025))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2027) .cse1 v_ArrVal_2030)) |c_~#stored_elements~0.base| v_ArrVal_2031))) (let ((.cse3 (select .cse2 |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2030) (not (= 400 (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_2033) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2034) .cse4 v_ArrVal_2036)) |c_~#stored_elements~0.base| v_ArrVal_2038) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| (select .cse3 .cse4)))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81| (select .cse5 .cse1)))))) is different from false [2023-05-04 04:32:20,663 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2030 Int) (v_ArrVal_2034 Int) (v_ArrVal_2033 Int) (v_ArrVal_2025 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_2036 Int) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2027 Int) (v_ArrVal_2031 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81| Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store .cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81|)) v_ArrVal_2025)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2027) .cse4 v_ArrVal_2030)) |c_~#stored_elements~0.base| v_ArrVal_2031))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_2033) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2034) .cse2 v_ArrVal_2036)) |c_~#stored_elements~0.base| v_ArrVal_2038) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81| (select .cse3 .cse4))) (< (+ (select .cse5 .cse4) 1) v_ArrVal_2030) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| (select .cse1 .cse2))))))))) is different from false [2023-05-04 04:32:35,085 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2024 (Array Int Int)) (v_ArrVal_2023 (Array Int Int)) (v_ArrVal_2031 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81| Int) (v_ArrVal_2030 Int) (v_ArrVal_2034 Int) (v_ArrVal_2033 Int) (v_ArrVal_2025 Int) (v_ArrVal_2036 Int) (v_ArrVal_2027 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_2023) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2024))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|))) (let ((.cse3 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81|)) v_ArrVal_2025)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (store (store .cse6 |c_~#queue~0.base| (store (store .cse3 .cse5 v_ArrVal_2027) .cse1 v_ArrVal_2030)) |c_~#stored_elements~0.base| v_ArrVal_2031))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81| (select .cse2 .cse1))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2030) (not (= 400 (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_2033) .cse5 v_ArrVal_2034) .cse1 v_ArrVal_2036)) |c_~#stored_elements~0.base| v_ArrVal_2038) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|))))))))))) is different from false [2023-05-04 04:32:36,245 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2024 (Array Int Int)) (v_ArrVal_2023 (Array Int Int)) (v_ArrVal_2031 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81| Int) (v_ArrVal_2030 Int) (v_ArrVal_2034 Int) (v_ArrVal_2022 Int) (v_ArrVal_2033 Int) (v_ArrVal_2025 Int) (v_ArrVal_2036 Int) (v_ArrVal_2027 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_2022)))) (let ((.cse9 (store (store .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_2023) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2024))) (let ((.cse2 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81|)) v_ArrVal_2025)) (.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse7 (store (store .cse9 |c_~#queue~0.base| (store (store .cse6 .cse8 v_ArrVal_2027) .cse1 v_ArrVal_2030)) |c_~#stored_elements~0.base| v_ArrVal_2031))) (let ((.cse0 (select .cse7 |c_~#queue~0.base|)) (.cse4 (+ 1600 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81| (select .cse2 .cse1))) (not (let ((.cse3 (select .cse5 |c_~#queue~0.base|))) (= (select .cse3 .cse4) (select .cse3 .cse1)))) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2030) (not (= 400 (select (select (store (store .cse7 |c_~#queue~0.base| (store (store (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_2033) .cse8 v_ArrVal_2034) .cse1 v_ArrVal_2036)) |c_~#stored_elements~0.base| v_ArrVal_2038) |c_~#queue~0.base|) .cse4))))))))))) is different from false [2023-05-04 04:32:36,320 INFO L356 Elim1Store]: treesize reduction 96, result has 47.0 percent of original size [2023-05-04 04:32:36,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1163 treesize of output 1031 [2023-05-04 04:32:36,373 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:32:36,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2264 treesize of output 2226 [2023-05-04 04:32:36,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1284 treesize of output 1252 [2023-05-04 04:32:36,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1010 treesize of output 946 [2023-05-04 04:32:36,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1281 treesize of output 1217 [2023-05-04 04:32:36,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1814 treesize of output 1750 [2023-05-04 04:32:36,948 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:32:36,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 52 [2023-05-04 04:32:37,173 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:32:37,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 367 treesize of output 349 [2023-05-04 04:32:38,262 INFO L356 Elim1Store]: treesize reduction 5, result has 93.8 percent of original size [2023-05-04 04:32:38,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 131 [2023-05-04 04:32:38,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3531 backedges. 644 proven. 5 refuted. 0 times theorem prover too weak. 2882 trivial. 0 not checked. [2023-05-04 04:32:38,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434398131] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 04:32:38,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 04:32:38,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 32, 37] total 146 [2023-05-04 04:32:38,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190882484] [2023-05-04 04:32:38,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 04:32:38,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 146 states [2023-05-04 04:32:38,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:32:38,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2023-05-04 04:32:38,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1182, Invalid=17174, Unknown=44, NotChecked=2770, Total=21170 [2023-05-04 04:32:38,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:32:38,467 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:32:38,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 146 states, 146 states have (on average 7.36986301369863) internal successors, (1076), 146 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 04:32:38,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:32:38,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:32:38,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 04:32:38,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 04:32:38,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 114 states. [2023-05-04 04:32:38,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:32:38,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:32:38,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-05-04 04:32:38,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:33:19,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:33:19,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:33:19,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 04:33:19,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 04:33:19,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2023-05-04 04:33:19,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:33:19,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:33:19,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-05-04 04:33:19,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2023-05-04 04:33:19,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-05-04 04:33:19,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-05-04 04:33:19,415 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:33:19,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:33:19,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1577972480, now seen corresponding path program 2 times [2023-05-04 04:33:19,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:33:19,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397069585] [2023-05-04 04:33:19,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:33:19,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:33:20,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:33:48,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3553 backedges. 1672 proven. 1630 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2023-05-04 04:33:48,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:33:48,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397069585] [2023-05-04 04:33:48,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397069585] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 04:33:48,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078215031] [2023-05-04 04:33:48,034 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 04:33:48,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 04:33:48,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 04:33:48,036 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 04:33:48,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-05-04 04:33:48,705 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 04:33:48,705 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 04:33:48,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 1978 conjuncts, 189 conjunts are in the unsatisfiable core [2023-05-04 04:33:48,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 04:33:50,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 32 treesize of output 16 [2023-05-04 04:33:50,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:33:50,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2023-05-04 04:33:50,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:33:50,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2023-05-04 04:33:50,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2023-05-04 04:33:51,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:33:51,267 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 04:33:51,290 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2023-05-04 04:33:51,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2023-05-04 04:33:51,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:33:51,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:33:51,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 49 treesize of output 45 [2023-05-04 04:33:52,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 32 [2023-05-04 04:33:52,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:33:52,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2023-05-04 04:33:52,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:33:52,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:33:52,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 39 [2023-05-04 04:33:53,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 32 [2023-05-04 04:33:54,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:33:54,189 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 04:33:54,208 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2023-05-04 04:33:54,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 50 [2023-05-04 04:33:54,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:33:54,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:33:54,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 59 treesize of output 49 [2023-05-04 04:33:55,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 36 [2023-05-04 04:33:55,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:33:55,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2023-05-04 04:33:56,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:33:56,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:33:56,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 53 treesize of output 43 [2023-05-04 04:33:56,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 36 [2023-05-04 04:33:58,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:33:58,131 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 04:33:58,149 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2023-05-04 04:33:58,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 54 [2023-05-04 04:33:58,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:33:58,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:33:58,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 69 treesize of output 53 [2023-05-04 04:33:59,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 38 [2023-05-04 04:33:59,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:33:59,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-05-04 04:33:59,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:33:59,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-05-04 04:33:59,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-05-04 04:33:59,704 INFO L134 CoverageAnalysis]: Checked inductivity of 3553 backedges. 2415 proven. 307 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2023-05-04 04:33:59,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 04:33:59,966 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2540 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2540) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)) 400))) is different from false [2023-05-04 04:34:02,207 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2530 Int) (v_ArrVal_2535 Int) (v_ArrVal_2540 (Array Int Int)) (v_ArrVal_2536 Int) (v_ArrVal_2529 (Array Int Int)) (v_ArrVal_2538 Int)) (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ 1600 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2529))) (let ((.cse0 (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store (store (store .cse5 .cse3 v_ArrVal_2530) .cse4 (+ (select .cse5 .cse4) 1)) (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2535)))) (or (= 400 (select .cse0 .cse1)) (not (= 400 (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_2536) .cse1 v_ArrVal_2538)) |c_~#stored_elements~0.base| v_ArrVal_2540) |c_~#queue~0.base|) .cse4))))))) is different from false [2023-05-04 04:34:02,292 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2530 Int) (v_ArrVal_2535 Int) (v_ArrVal_2540 (Array Int Int)) (v_ArrVal_2536 Int) (v_ArrVal_2529 (Array Int Int)) (v_ArrVal_2538 Int)) (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ 1600 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2529))) (let ((.cse1 (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store (store (store .cse5 .cse2 v_ArrVal_2530) .cse4 (+ (select .cse5 .cse4) 1)) (+ |c_~#queue~0.offset| (* (select .cse5 .cse3) 4)) v_ArrVal_2535)))) (or (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_2536) .cse3 v_ArrVal_2538)) |c_~#stored_elements~0.base| v_ArrVal_2540) |c_~#queue~0.base|) .cse4))) (= 400 (select .cse1 .cse3)))))) is different from false [2023-05-04 04:34:02,308 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2530 Int) (v_ArrVal_2535 Int) (v_ArrVal_2540 (Array Int Int)) (v_ArrVal_2536 Int) (v_ArrVal_2529 (Array Int Int)) (v_ArrVal_2538 Int)) (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ 1600 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2529))) (let ((.cse1 (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store (store (store .cse5 .cse2 v_ArrVal_2530) .cse4 (+ (select .cse5 .cse4) 1)) (+ (* (select .cse5 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2535)))) (or (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_2536) .cse3 v_ArrVal_2538)) |c_~#stored_elements~0.base| v_ArrVal_2540) |c_~#queue~0.base|) .cse4))) (= 400 (select .cse1 .cse3)))))) is different from false [2023-05-04 04:34:02,323 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2530 Int) (v_ArrVal_2535 Int) (v_ArrVal_2540 (Array Int Int)) (v_ArrVal_2536 Int) (v_ArrVal_2529 (Array Int Int)) (v_ArrVal_2538 Int)) (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ 1600 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2529))) (let ((.cse0 (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store (store (store .cse5 .cse3 v_ArrVal_2530) .cse4 (+ (select .cse5 .cse4) 1)) (+ |c_~#queue~0.offset| (* 4 (select .cse5 .cse1))) v_ArrVal_2535)))) (or (= 400 (select .cse0 .cse1)) (not (= 400 (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_2536) .cse1 v_ArrVal_2538)) |c_~#stored_elements~0.base| v_ArrVal_2540) |c_~#queue~0.base|) .cse4))))))) is different from false [2023-05-04 04:34:02,483 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse8 (select .cse6 .cse7))) (or (forall ((v_ArrVal_2530 Int) (v_ArrVal_2535 Int) (v_ArrVal_2540 (Array Int Int)) (v_ArrVal_2536 Int) (v_ArrVal_2529 (Array Int Int)) (v_ArrVal_2538 Int)) (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ 1600 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse7 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2529))) (let ((.cse0 (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store (store (store .cse5 .cse3 v_ArrVal_2530) .cse4 (+ (select .cse5 .cse4) 1)) (+ |c_~#queue~0.offset| (* 4 (select .cse5 .cse1))) v_ArrVal_2535)))) (or (= 400 (select .cse0 .cse1)) (not (= 400 (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_2536) .cse1 v_ArrVal_2538)) |c_~#stored_elements~0.base| v_ArrVal_2540) |c_~#queue~0.base|) .cse4))))))) (= 400 .cse8)))) is different from false [2023-05-04 04:34:02,516 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse7 .cse8))) (or (= 400 .cse0) (forall ((v_ArrVal_2530 Int) (v_ArrVal_2535 Int) (v_ArrVal_2540 (Array Int Int)) (v_ArrVal_2525 Int) (v_ArrVal_2536 Int) (v_ArrVal_2529 (Array Int Int)) (v_ArrVal_2538 Int)) (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ 1600 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2525) .cse8 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2529))) (let ((.cse2 (let ((.cse6 (select .cse1 |c_~#queue~0.base|))) (store (store (store .cse6 .cse3 v_ArrVal_2530) .cse5 (+ (select .cse6 .cse5) 1)) (+ (* (select .cse6 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2535)))) (or (not (= 400 (select (select (store (store .cse1 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_2536) .cse4 v_ArrVal_2538)) |c_~#stored_elements~0.base| v_ArrVal_2540) |c_~#queue~0.base|) .cse5))) (= 400 (select .cse2 .cse4))))))))) is different from false [2023-05-04 04:34:02,572 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2530 Int) (v_ArrVal_2535 Int) (v_ArrVal_2540 (Array Int Int)) (v_ArrVal_2523 Int) (v_ArrVal_2525 Int) (v_ArrVal_2536 Int) (v_ArrVal_2529 (Array Int Int)) (v_ArrVal_2538 Int)) (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_2523)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse7 .cse8))) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ 1600 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2525) .cse8 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2529))) (let ((.cse1 (let ((.cse6 (select .cse3 |c_~#queue~0.base|))) (store (store (store .cse6 .cse4 v_ArrVal_2530) .cse5 (+ (select .cse6 .cse5) 1)) (+ |c_~#queue~0.offset| (* (select .cse6 .cse2) 4)) v_ArrVal_2535)))) (or (= 400 .cse0) (= 400 (select .cse1 .cse2)) (not (= 400 (select (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse1 .cse4 v_ArrVal_2536) .cse2 v_ArrVal_2538)) |c_~#stored_elements~0.base| v_ArrVal_2540) |c_~#queue~0.base|) .cse5))))))))) is different from false [2023-05-04 04:34:02,592 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2530 Int) (v_ArrVal_2535 Int) (v_ArrVal_2540 (Array Int Int)) (v_ArrVal_2523 Int) (v_ArrVal_2525 Int) (v_ArrVal_2536 Int) (v_ArrVal_2529 (Array Int Int)) (v_ArrVal_2538 Int)) (let ((.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse7 (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse9 (+ (* (select .cse9 .cse8) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2523)))) (let ((.cse5 (select .cse7 .cse8))) (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ 1600 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2525) .cse8 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2529))) (let ((.cse1 (let ((.cse6 (select .cse0 |c_~#queue~0.base|))) (store (store (store .cse6 .cse2 v_ArrVal_2530) .cse4 (+ (select .cse6 .cse4) 1)) (+ (* 4 (select .cse6 .cse3)) |c_~#queue~0.offset|) v_ArrVal_2535)))) (or (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_2536) .cse3 v_ArrVal_2538)) |c_~#stored_elements~0.base| v_ArrVal_2540) |c_~#queue~0.base|) .cse4))) (= 400 .cse5) (= 400 (select .cse1 .cse3))))))))) is different from false [2023-05-04 04:34:02,628 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2530 Int) (v_ArrVal_2535 Int) (v_ArrVal_2540 (Array Int Int)) (v_ArrVal_2523 Int) (v_ArrVal_2525 Int) (v_ArrVal_2536 Int) (v_ArrVal_2529 (Array Int Int)) (v_ArrVal_2538 Int)) (let ((.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse7 (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse9 (+ (* (select .cse9 .cse8) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2523)))) (let ((.cse5 (select .cse7 .cse8))) (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ 1600 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse7 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2525) .cse8 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2529))) (let ((.cse1 (let ((.cse6 (select .cse0 |c_~#queue~0.base|))) (store (store (store .cse6 .cse2 v_ArrVal_2530) .cse4 (+ (select .cse6 .cse4) 1)) (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2535)))) (or (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_2536) .cse3 v_ArrVal_2538)) |c_~#stored_elements~0.base| v_ArrVal_2540) |c_~#queue~0.base|) .cse4))) (= 400 (select .cse1 .cse3)) (= 400 .cse5)))))))) is different from false [2023-05-04 04:34:05,367 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2519 Int) (v_ArrVal_2530 Int) (v_ArrVal_2535 Int) (v_ArrVal_2540 (Array Int Int)) (v_ArrVal_2523 Int) (v_ArrVal_2525 Int) (v_ArrVal_2536 Int) (v_ArrVal_2518 (Array Int Int)) (v_ArrVal_2529 (Array Int Int)) (v_ArrVal_2538 Int)) (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ 1600 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2518))) (let ((.cse8 (let ((.cse9 (select .cse7 |c_~#queue~0.base|))) (store (store (store .cse9 .cse3 v_ArrVal_2519) .cse4 (+ (select .cse9 .cse4) 1)) (+ |c_~#queue~0.offset| (* 4 (select .cse9 .cse1))) v_ArrVal_2523)))) (let ((.cse5 (select .cse8 .cse1))) (let ((.cse2 (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse3 v_ArrVal_2525) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2529))) (let ((.cse0 (let ((.cse6 (select .cse2 |c_~#queue~0.base|))) (store (store (store .cse6 .cse3 v_ArrVal_2530) .cse4 (+ (select .cse6 .cse4) 1)) (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2535)))) (or (= 400 (select .cse0 .cse1)) (not (= 400 (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_2536) .cse1 v_ArrVal_2538)) |c_~#stored_elements~0.base| v_ArrVal_2540) |c_~#queue~0.base|) .cse4))) (= 400 .cse5)))))))) is different from false [2023-05-04 04:34:06,072 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse12 (select .cse10 .cse11))) (or (forall ((v_ArrVal_2519 Int) (v_ArrVal_2530 Int) (v_ArrVal_2535 Int) (v_ArrVal_2540 (Array Int Int)) (v_ArrVal_2523 Int) (v_ArrVal_2525 Int) (v_ArrVal_2536 Int) (v_ArrVal_2518 (Array Int Int)) (v_ArrVal_2529 (Array Int Int)) (v_ArrVal_2538 Int)) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ 1600 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse10 .cse11 (+ .cse12 1))) |c_~#stored_elements~0.base| v_ArrVal_2518))) (let ((.cse8 (let ((.cse9 (select .cse7 |c_~#queue~0.base|))) (store (store (store .cse9 .cse4 v_ArrVal_2519) .cse5 (+ (select .cse9 .cse5) 1)) (+ |c_~#queue~0.offset| (* (select .cse9 .cse2) 4)) v_ArrVal_2523)))) (let ((.cse0 (select .cse8 .cse2))) (let ((.cse3 (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse4 v_ArrVal_2525) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2529))) (let ((.cse1 (let ((.cse6 (select .cse3 |c_~#queue~0.base|))) (store (store (store .cse6 .cse4 v_ArrVal_2530) .cse5 (+ (select .cse6 .cse5) 1)) (+ (* 4 (select .cse6 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2535)))) (or (= 400 .cse0) (= 400 (select .cse1 .cse2)) (not (= 400 (select (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse1 .cse4 v_ArrVal_2536) .cse2 v_ArrVal_2538)) |c_~#stored_elements~0.base| v_ArrVal_2540) |c_~#queue~0.base|) .cse5)))))))))) (= 400 .cse12)))) is different from false [2023-05-04 04:34:06,180 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse11 .cse12))) (or (= 400 .cse0) (forall ((v_ArrVal_2519 Int) (v_ArrVal_2530 Int) (v_ArrVal_2535 Int) (v_ArrVal_2540 (Array Int Int)) (v_ArrVal_2523 Int) (v_ArrVal_2514 Int) (v_ArrVal_2525 Int) (v_ArrVal_2536 Int) (v_ArrVal_2518 (Array Int Int)) (v_ArrVal_2529 (Array Int Int)) (v_ArrVal_2538 Int)) (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (+ 1600 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse11 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2514) .cse12 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2518))) (let ((.cse9 (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store (store (store .cse10 .cse5 v_ArrVal_2519) .cse6 (+ (select .cse10 .cse6) 1)) (+ |c_~#queue~0.offset| (* (select .cse10 .cse2) 4)) v_ArrVal_2523)))) (let ((.cse3 (select .cse9 .cse2))) (let ((.cse4 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse5 v_ArrVal_2525) .cse2 (+ 1 .cse3))) |c_~#stored_elements~0.base| v_ArrVal_2529))) (let ((.cse1 (let ((.cse7 (select .cse4 |c_~#queue~0.base|))) (store (store (store .cse7 .cse5 v_ArrVal_2530) .cse6 (+ (select .cse7 .cse6) 1)) (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2535)))) (or (= 400 (select .cse1 .cse2)) (= 400 .cse3) (not (= (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse1 .cse5 v_ArrVal_2536) .cse2 v_ArrVal_2538)) |c_~#stored_elements~0.base| v_ArrVal_2540) |c_~#queue~0.base|) .cse6) 400)))))))))))) is different from false [2023-05-04 04:34:06,274 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2519 Int) (v_ArrVal_2540 (Array Int Int)) (v_ArrVal_2530 Int) (v_ArrVal_2535 Int) (v_ArrVal_2512 Int) (v_ArrVal_2523 Int) (v_ArrVal_2514 Int) (v_ArrVal_2525 Int) (v_ArrVal_2536 Int) (v_ArrVal_2518 (Array Int Int)) (v_ArrVal_2529 (Array Int Int)) (v_ArrVal_2538 Int)) (let ((.cse11 (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_2512)) (.cse12 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse3 (select .cse11 .cse12))) (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (+ 1600 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse11 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2514) .cse12 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_2518))) (let ((.cse9 (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store (store (store .cse10 .cse5 v_ArrVal_2519) .cse6 (+ (select .cse10 .cse6) 1)) (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2523)))) (let ((.cse2 (select .cse9 .cse1))) (let ((.cse4 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse5 v_ArrVal_2525) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2529))) (let ((.cse0 (let ((.cse7 (select .cse4 |c_~#queue~0.base|))) (store (store (store .cse7 .cse5 v_ArrVal_2530) .cse6 (+ (select .cse7 .cse6) 1)) (+ (* 4 (select .cse7 .cse1)) |c_~#queue~0.offset|) v_ArrVal_2535)))) (or (= (select .cse0 .cse1) 400) (= 400 .cse2) (= .cse3 400) (not (= 400 (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_2536) .cse1 v_ArrVal_2538)) |c_~#stored_elements~0.base| v_ArrVal_2540) |c_~#queue~0.base|) .cse6)))))))))))) is different from false [2023-05-04 04:34:06,306 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2519 Int) (v_ArrVal_2540 (Array Int Int)) (v_ArrVal_2530 Int) (v_ArrVal_2535 Int) (v_ArrVal_2512 Int) (v_ArrVal_2523 Int) (v_ArrVal_2514 Int) (v_ArrVal_2525 Int) (v_ArrVal_2536 Int) (v_ArrVal_2518 (Array Int Int)) (v_ArrVal_2529 (Array Int Int)) (v_ArrVal_2538 Int)) (let ((.cse12 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse11 (let ((.cse13 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse13 (+ (* (select .cse13 .cse12) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2512)))) (let ((.cse5 (select .cse11 .cse12))) (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ 1600 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse11 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2514) .cse12 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2518))) (let ((.cse9 (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store (store (store .cse10 .cse2 v_ArrVal_2519) .cse4 (+ (select .cse10 .cse4) 1)) (+ |c_~#queue~0.offset| (* (select .cse10 .cse3) 4)) v_ArrVal_2523)))) (let ((.cse6 (select .cse9 .cse3))) (let ((.cse0 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse2 v_ArrVal_2525) .cse3 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2529))) (let ((.cse1 (let ((.cse7 (select .cse0 |c_~#queue~0.base|))) (store (store (store .cse7 .cse2 v_ArrVal_2530) .cse4 (+ (select .cse7 .cse4) 1)) (+ (* 4 (select .cse7 .cse3)) |c_~#queue~0.offset|) v_ArrVal_2535)))) (or (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_2536) .cse3 v_ArrVal_2538)) |c_~#stored_elements~0.base| v_ArrVal_2540) |c_~#queue~0.base|) .cse4))) (= 400 (select .cse1 .cse3)) (= 400 .cse5) (= .cse6 400))))))))))) is different from false [2023-05-04 04:34:06,375 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2519 Int) (v_ArrVal_2540 (Array Int Int)) (v_ArrVal_2530 Int) (v_ArrVal_2535 Int) (v_ArrVal_2512 Int) (v_ArrVal_2523 Int) (v_ArrVal_2514 Int) (v_ArrVal_2525 Int) (v_ArrVal_2536 Int) (v_ArrVal_2518 (Array Int Int)) (v_ArrVal_2529 (Array Int Int)) (v_ArrVal_2538 Int)) (let ((.cse12 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse11 (let ((.cse13 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse13 (+ (* (select .cse13 .cse12) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2512)))) (let ((.cse5 (select .cse11 .cse12))) (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ 1600 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse11 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2514) .cse12 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2518))) (let ((.cse9 (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store (store (store .cse10 .cse3 v_ArrVal_2519) .cse4 (+ (select .cse10 .cse4) 1)) (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2523)))) (let ((.cse6 (select .cse9 .cse1))) (let ((.cse2 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse3 v_ArrVal_2525) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2529))) (let ((.cse0 (let ((.cse7 (select .cse2 |c_~#queue~0.base|))) (store (store (store .cse7 .cse3 v_ArrVal_2530) .cse4 (+ (select .cse7 .cse4) 1)) (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2535)))) (or (= 400 (select .cse0 .cse1)) (not (= 400 (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_2536) .cse1 v_ArrVal_2538)) |c_~#stored_elements~0.base| v_ArrVal_2540) |c_~#queue~0.base|) .cse4))) (= 400 .cse5) (= 400 .cse6))))))))))) is different from false [2023-05-04 04:34:09,301 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2508 Int) (v_ArrVal_2519 Int) (v_ArrVal_2540 (Array Int Int)) (v_ArrVal_2530 Int) (v_ArrVal_2535 Int) (v_ArrVal_2512 Int) (v_ArrVal_2523 Int) (v_ArrVal_2514 Int) (v_ArrVal_2525 Int) (v_ArrVal_2536 Int) (v_ArrVal_2507 (Array Int Int)) (v_ArrVal_2518 (Array Int Int)) (v_ArrVal_2529 (Array Int Int)) (v_ArrVal_2538 Int)) (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ 1600 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse11 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2507))) (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store (store (store .cse13 .cse3 v_ArrVal_2508) .cse4 1) (+ (* 4 (select .cse13 .cse1)) |c_~#queue~0.offset|) v_ArrVal_2512)))) (let ((.cse6 (select .cse12 .cse1))) (let ((.cse8 (store (store .cse11 |c_~#queue~0.base| (store (store .cse12 .cse3 v_ArrVal_2514) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2518))) (let ((.cse9 (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store (store (store .cse10 .cse3 v_ArrVal_2519) .cse4 (+ (select .cse10 .cse4) 1)) (+ |c_~#queue~0.offset| (* (select .cse10 .cse1) 4)) v_ArrVal_2523)))) (let ((.cse5 (select .cse9 .cse1))) (let ((.cse2 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse3 v_ArrVal_2525) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2529))) (let ((.cse0 (let ((.cse7 (select .cse2 |c_~#queue~0.base|))) (store (store (store .cse7 .cse3 v_ArrVal_2530) .cse4 (+ (select .cse7 .cse4) 1)) (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2535)))) (or (= 400 (select .cse0 .cse1)) (not (= 400 (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_2536) .cse1 v_ArrVal_2538)) |c_~#stored_elements~0.base| v_ArrVal_2540) |c_~#queue~0.base|) .cse4))) (= .cse5 400) (= .cse6 400))))))))))) is different from false [2023-05-04 04:34:10,673 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:34:10,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 10043 treesize of output 5333 [2023-05-04 04:34:10,751 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:34:10,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4041 treesize of output 3899 [2023-05-04 04:34:10,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2357 treesize of output 2161 [2023-05-04 04:34:10,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1569 treesize of output 1537 [2023-05-04 04:34:10,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2759 treesize of output 2663 [2023-05-04 04:34:10,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2805 treesize of output 2629 [2023-05-04 04:34:10,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-05-04 04:34:10,957 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:34:10,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 542 treesize of output 454 [2023-05-04 04:34:39,499 INFO L134 CoverageAnalysis]: Checked inductivity of 3553 backedges. 1995 proven. 439 refuted. 93 times theorem prover too weak. 844 trivial. 182 not checked. [2023-05-04 04:34:39,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078215031] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 04:34:39,500 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 04:34:39,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 56, 60] total 196 [2023-05-04 04:34:39,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168433130] [2023-05-04 04:34:39,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 04:34:39,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 196 states [2023-05-04 04:34:39,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:34:39,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2023-05-04 04:34:39,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2917, Invalid=28674, Unknown=339, NotChecked=6290, Total=38220 [2023-05-04 04:34:39,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:34:39,511 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:34:39,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 196 states, 196 states have (on average 8.98469387755102) internal successors, (1761), 196 states have internal predecessors, (1761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 04:34:39,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:34:39,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:34:39,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 04:34:39,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 04:34:39,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 114 states. [2023-05-04 04:34:39,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:34:39,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:34:39,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-05-04 04:34:39,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2023-05-04 04:34:39,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:35:39,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:35:39,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:35:39,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 04:35:39,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 04:35:39,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2023-05-04 04:35:39,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:35:39,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:35:39,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-05-04 04:35:39,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2023-05-04 04:35:39,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2023-05-04 04:35:39,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-05-04 04:35:39,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-05-04 04:35:39,579 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:35:39,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:35:39,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1779171119, now seen corresponding path program 3 times [2023-05-04 04:35:39,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:35:39,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951013509] [2023-05-04 04:35:39,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:35:39,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:35:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:37:27,550 INFO L134 CoverageAnalysis]: Checked inductivity of 7321 backedges. 82 proven. 7239 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 04:37:27,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:37:27,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951013509] [2023-05-04 04:37:27,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951013509] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 04:37:27,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848153681] [2023-05-04 04:37:27,551 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-04 04:37:27,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 04:37:27,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 04:37:27,553 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 04:37:27,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-05-04 04:38:38,918 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2023-05-04 04:38:38,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 04:38:38,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 1486 conjuncts, 265 conjunts are in the unsatisfiable core [2023-05-04 04:38:38,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 04:38:43,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-05-04 04:38:44,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:38:44,218 INFO L356 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2023-05-04 04:38:44,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 48 [2023-05-04 04:38:44,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:38:44,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:38:44,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 41 [2023-05-04 04:38:45,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2023-05-04 04:38:45,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:38:45,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 26 [2023-05-04 04:38:45,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:38:45,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:38:45,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 35 [2023-05-04 04:38:46,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2023-05-04 04:38:47,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:38:47,253 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 04:38:47,272 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2023-05-04 04:38:47,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2023-05-04 04:38:47,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:38:47,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:38:47,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 49 treesize of output 45 [2023-05-04 04:38:48,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 32 [2023-05-04 04:38:48,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:38:48,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2023-05-04 04:38:49,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:38:49,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:38:49,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 39 [2023-05-04 04:38:49,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 35 [2023-05-04 04:38:50,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:38:50,084 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 04:38:50,106 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2023-05-04 04:38:50,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 50 [2023-05-04 04:38:50,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:38:50,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:38:50,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 59 treesize of output 49 [2023-05-04 04:38:50,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 36 [2023-05-04 04:38:51,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:38:51,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2023-05-04 04:38:51,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:38:51,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:38:51,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 53 treesize of output 43 [2023-05-04 04:38:52,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 39 [2023-05-04 04:38:53,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:38:53,562 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 04:38:53,579 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2023-05-04 04:38:53,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 54 [2023-05-04 04:38:53,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:38:53,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:38:53,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 69 treesize of output 53 [2023-05-04 04:38:54,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 40 [2023-05-04 04:38:55,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:38:55,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2023-05-04 04:38:56,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:38:56,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:38:56,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 63 treesize of output 47 [2023-05-04 04:38:57,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 43 [2023-05-04 04:38:59,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:38:59,634 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 04:38:59,650 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2023-05-04 04:38:59,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 58 [2023-05-04 04:38:59,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:38:59,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:38:59,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 79 treesize of output 57 [2023-05-04 04:39:00,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 44 [2023-05-04 04:39:00,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:39:00,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2023-05-04 04:39:01,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:39:01,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:39:01,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 73 treesize of output 51 [2023-05-04 04:39:02,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 47 [2023-05-04 04:39:03,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:39:03,652 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 04:39:03,668 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2023-05-04 04:39:03,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 62 [2023-05-04 04:39:04,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:39:04,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:39:04,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 89 treesize of output 61 [2023-05-04 04:39:04,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 46 [2023-05-04 04:39:04,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:39:04,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-05-04 04:39:05,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-05-04 04:39:05,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-05-04 04:39:05,325 INFO L134 CoverageAnalysis]: Checked inductivity of 7321 backedges. 3836 proven. 1403 refuted. 0 times theorem prover too weak. 2082 trivial. 0 not checked. [2023-05-04 04:39:05,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 04:39:05,571 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3230 (Array Int Int))) (not (= 400 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3230) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|))))) is different from false [2023-05-04 04:40:13,269 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3229 Int) (v_ArrVal_3230 (Array Int Int)) (v_ArrVal_3227 Int) (v_ArrVal_3225 Int) (v_ArrVal_3223 Int) (v_ArrVal_3221 Int) (v_ArrVal_3219 (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|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_3219))) (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ 1600 |c_~#queue~0.offset|)) (.cse2 (select .cse4 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (store (store (store .cse2 .cse5 v_ArrVal_3221) .cse3 v_ArrVal_3223) (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_3225))) (or (= 400 (select .cse0 .cse1)) (< (+ 1 (select .cse2 .cse3)) v_ArrVal_3223) (not (= 400 (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_3227) .cse1 v_ArrVal_3229)) |c_~#stored_elements~0.base| v_ArrVal_3230) |c_~#queue~0.base|) .cse3)))))))) is different from false [2023-05-04 04:40:24,958 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse8 (select .cse6 .cse7))) (or (forall ((v_ArrVal_3229 Int) (v_ArrVal_3230 (Array Int Int)) (v_ArrVal_3216 Int) (v_ArrVal_3227 Int) (v_ArrVal_3225 Int) (v_ArrVal_3223 Int) (v_ArrVal_3221 Int) (v_ArrVal_3219 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3216) .cse7 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_3219))) (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ 1600 |c_~#queue~0.offset|)) (.cse2 (select .cse4 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (store (store (store .cse2 .cse5 v_ArrVal_3221) .cse3 v_ArrVal_3223) (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_3225))) (or (= (select .cse0 .cse1) 400) (< (+ (select .cse2 .cse3) 1) v_ArrVal_3223) (not (= 400 (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_3227) .cse1 v_ArrVal_3229)) |c_~#stored_elements~0.base| v_ArrVal_3230) |c_~#queue~0.base|) .cse3)))))))) (= 400 .cse8)))) is different from false [2023-05-04 04:40:25,060 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3229 Int) (v_ArrVal_3230 (Array Int Int)) (v_ArrVal_3216 Int) (v_ArrVal_3227 Int) (v_ArrVal_3214 Int) (v_ArrVal_3225 Int) (v_ArrVal_3223 Int) (v_ArrVal_3221 Int) (v_ArrVal_3219 (Array Int Int))) (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_3214)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select .cse7 .cse8))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3216) .cse8 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_3219))) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ 1600 |c_~#queue~0.offset|)) (.cse6 (select .cse3 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (store (store (store .cse6 .cse4 v_ArrVal_3221) .cse5 v_ArrVal_3223) (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_3225))) (or (= 400 (select .cse0 .cse1)) (= 400 .cse2) (not (= 400 (select (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_3227) .cse1 v_ArrVal_3229)) |c_~#stored_elements~0.base| v_ArrVal_3230) |c_~#queue~0.base|) .cse5))) (< (+ (select .cse6 .cse5) 1) v_ArrVal_3223)))))))) is different from false [2023-05-04 04:40:25,096 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3229 Int) (v_ArrVal_3230 (Array Int Int)) (v_ArrVal_3216 Int) (v_ArrVal_3227 Int) (v_ArrVal_3214 Int) (v_ArrVal_3225 Int) (v_ArrVal_3223 Int) (v_ArrVal_3221 Int) (v_ArrVal_3219 (Array Int Int))) (let ((.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse7 (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse9 (+ (* (select .cse9 .cse8) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3214)))) (let ((.cse2 (select .cse7 .cse8))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3216) .cse8 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_3219))) (let ((.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ 1600 |c_~#queue~0.offset|)) (.cse3 (select .cse5 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (store (store (store .cse3 .cse6 v_ArrVal_3221) .cse4 v_ArrVal_3223) (+ (* 4 (select .cse3 .cse1)) |c_~#queue~0.offset|) v_ArrVal_3225))) (or (= 400 (select .cse0 .cse1)) (= 400 .cse2) (< (+ (select .cse3 .cse4) 1) v_ArrVal_3223) (not (= 400 (select (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse6 v_ArrVal_3227) .cse1 v_ArrVal_3229)) |c_~#stored_elements~0.base| v_ArrVal_3230) |c_~#queue~0.base|) .cse4))))))))))) is different from false [2023-05-04 04:40:25,157 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3229 Int) (v_ArrVal_3230 (Array Int Int)) (v_ArrVal_3216 Int) (v_ArrVal_3227 Int) (v_ArrVal_3214 Int) (v_ArrVal_3225 Int) (v_ArrVal_3223 Int) (v_ArrVal_3221 Int) (v_ArrVal_3219 (Array Int Int))) (let ((.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse7 (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse9 (+ (* (select .cse9 .cse8) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_3214)))) (let ((.cse5 (select .cse7 .cse8))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse7 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_3216) .cse8 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_3219))) (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ 1600 |c_~#queue~0.offset|)) (.cse6 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (store (store (store .cse6 .cse3 v_ArrVal_3221) .cse4 v_ArrVal_3223) (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_3225))) (or (= 400 (select .cse0 .cse1)) (not (= 400 (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_3227) .cse1 v_ArrVal_3229)) |c_~#stored_elements~0.base| v_ArrVal_3230) |c_~#queue~0.base|) .cse4))) (= 400 .cse5) (< (+ (select .cse6 .cse4) 1) v_ArrVal_3223))))))))) is different from false [2023-05-04 04:43:20,837 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3229 Int) (v_ArrVal_3216 Int) (v_ArrVal_3227 Int) (v_ArrVal_3214 Int) (v_ArrVal_3225 Int) (v_ArrVal_3212 Int) (v_ArrVal_3223 Int) (v_ArrVal_3210 Int) (v_ArrVal_3221 Int) (v_ArrVal_3230 (Array Int Int)) (v_ArrVal_3208 (Array Int Int)) (v_ArrVal_3219 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_3208))) (let ((.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ 1600 |c_~#queue~0.offset|)) (.cse0 (select .cse8 |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse9 (store (store (store .cse0 .cse7 v_ArrVal_3210) .cse1 v_ArrVal_3212) (+ (* (select .cse0 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_3214))) (let ((.cse2 (select .cse9 .cse4))) (let ((.cse6 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse7 v_ArrVal_3216) .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_3219))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse3 (store (store (store .cse5 .cse7 v_ArrVal_3221) .cse1 v_ArrVal_3223) (+ |c_~#queue~0.offset| (* (select .cse5 .cse4) 4)) v_ArrVal_3225))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_3212) (= 400 .cse2) (= 400 (select .cse3 .cse4)) (< (+ (select .cse5 .cse1) 1) v_ArrVal_3223) (not (= 400 (select (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse3 .cse7 v_ArrVal_3227) .cse4 v_ArrVal_3229)) |c_~#stored_elements~0.base| v_ArrVal_3230) |c_~#queue~0.base|) .cse1)))))))))))) is different from false [2023-05-04 04:43:31,129 WARN L833 $PredicateComparison]: unable to prove that (or (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|) (forall ((v_ArrVal_3229 Int) (v_ArrVal_3216 Int) (v_ArrVal_3227 Int) (v_ArrVal_3214 Int) (v_ArrVal_3225 Int) (v_ArrVal_3212 Int) (v_ArrVal_3223 Int) (v_ArrVal_3210 Int) (v_ArrVal_3221 Int) (v_ArrVal_3230 (Array Int Int)) (v_ArrVal_3208 (Array Int Int)) (v_ArrVal_3219 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse10 .cse11 (+ (select .cse10 .cse11) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3208))) (let ((.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ 1600 |c_~#queue~0.offset|)) (.cse0 (select .cse8 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse9 (store (store (store .cse0 .cse6 v_ArrVal_3210) .cse1 v_ArrVal_3212) (+ (* (select .cse0 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_3214))) (let ((.cse4 (select .cse9 .cse3))) (let ((.cse5 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse6 v_ArrVal_3216) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_3219))) (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (store (store (store .cse7 .cse6 v_ArrVal_3221) .cse1 v_ArrVal_3223) (+ |c_~#queue~0.offset| (* (select .cse7 .cse3) 4)) v_ArrVal_3225))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_3212) (= 400 (select .cse2 .cse3)) (= 400 .cse4) (not (= 400 (select (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse6 v_ArrVal_3227) .cse3 v_ArrVal_3229)) |c_~#stored_elements~0.base| v_ArrVal_3230) |c_~#queue~0.base|) .cse1))) (< (+ (select .cse7 .cse1) 1) v_ArrVal_3223))))))))))) is different from false [2023-05-04 04:43:42,235 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse11 .cse12))) (or (= 400 .cse0) (forall ((v_ArrVal_3229 Int) (v_ArrVal_3205 Int) (v_ArrVal_3216 Int) (v_ArrVal_3227 Int) (v_ArrVal_3214 Int) (v_ArrVal_3225 Int) (v_ArrVal_3212 Int) (v_ArrVal_3223 Int) (v_ArrVal_3210 Int) (v_ArrVal_3221 Int) (v_ArrVal_3230 (Array Int Int)) (v_ArrVal_3208 (Array Int Int)) (v_ArrVal_3219 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse11 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3205) .cse12 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_3208))) (let ((.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ 1600 |c_~#queue~0.offset|)) (.cse8 (select .cse9 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse10 (store (store (store .cse8 .cse6 v_ArrVal_3210) .cse4 v_ArrVal_3212) (+ |c_~#queue~0.offset| (* (select .cse8 .cse2) 4)) v_ArrVal_3214))) (let ((.cse7 (select .cse10 .cse2))) (let ((.cse5 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse6 v_ArrVal_3216) .cse2 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_3219))) (let ((.cse3 (select .cse5 |c_~#queue~0.base|))) (let ((.cse1 (store (store (store .cse3 .cse6 v_ArrVal_3221) .cse4 v_ArrVal_3223) (+ |c_~#queue~0.offset| (* (select .cse3 .cse2) 4)) v_ArrVal_3225))) (or (= 400 (select .cse1 .cse2)) (< (+ (select .cse3 .cse4) 1) v_ArrVal_3223) (not (= (select (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse1 .cse6 v_ArrVal_3227) .cse2 v_ArrVal_3229)) |c_~#stored_elements~0.base| v_ArrVal_3230) |c_~#queue~0.base|) .cse4) 400)) (= 400 .cse7) (< (+ (select .cse8 .cse4) 1) v_ArrVal_3212))))))))))))) is different from false [2023-05-04 04:43:42,437 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3229 Int) (v_ArrVal_3205 Int) (v_ArrVal_3216 Int) (v_ArrVal_3227 Int) (v_ArrVal_3203 Int) (v_ArrVal_3214 Int) (v_ArrVal_3225 Int) (v_ArrVal_3212 Int) (v_ArrVal_3223 Int) (v_ArrVal_3210 Int) (v_ArrVal_3221 Int) (v_ArrVal_3230 (Array Int Int)) (v_ArrVal_3208 (Array Int Int)) (v_ArrVal_3219 (Array Int Int))) (let ((.cse11 (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_3203)) (.cse12 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse11 .cse12))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse11 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3205) .cse12 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_3208))) (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ 1600 |c_~#queue~0.offset|)) (.cse7 (select .cse9 |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse10 (store (store (store .cse7 .cse3 v_ArrVal_3210) .cse5 v_ArrVal_3212) (+ (* (select .cse7 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_3214))) (let ((.cse8 (select .cse10 .cse4))) (let ((.cse1 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse3 v_ArrVal_3216) .cse4 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_3219))) (let ((.cse6 (select .cse1 |c_~#queue~0.base|))) (let ((.cse2 (store (store (store .cse6 .cse3 v_ArrVal_3221) .cse5 v_ArrVal_3223) (+ (* (select .cse6 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_3225))) (or (= 400 .cse0) (not (= 400 (select (select (store (store .cse1 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_3227) .cse4 v_ArrVal_3229)) |c_~#stored_elements~0.base| v_ArrVal_3230) |c_~#queue~0.base|) .cse5))) (= 400 (select .cse2 .cse4)) (< (+ (select .cse6 .cse5) 1) v_ArrVal_3223) (< (+ (select .cse7 .cse5) 1) v_ArrVal_3212) (= 400 .cse8)))))))))))) is different from false [2023-05-04 04:43:42,497 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3229 Int) (v_ArrVal_3205 Int) (v_ArrVal_3216 Int) (v_ArrVal_3227 Int) (v_ArrVal_3203 Int) (v_ArrVal_3214 Int) (v_ArrVal_3225 Int) (v_ArrVal_3212 Int) (v_ArrVal_3223 Int) (v_ArrVal_3210 Int) (v_ArrVal_3221 Int) (v_ArrVal_3230 (Array Int Int)) (v_ArrVal_3208 (Array Int Int)) (v_ArrVal_3219 (Array Int Int))) (let ((.cse12 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse11 (let ((.cse13 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse13 (+ (* (select .cse13 .cse12) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3203)))) (let ((.cse7 (select .cse11 .cse12))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse11 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3205) .cse12 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_3208))) (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ 1600 |c_~#queue~0.offset|)) (.cse8 (select .cse9 |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse10 (store (store (store .cse8 .cse3 v_ArrVal_3210) .cse5 v_ArrVal_3212) (+ |c_~#queue~0.offset| (* (select .cse8 .cse4) 4)) v_ArrVal_3214))) (let ((.cse0 (select .cse10 .cse4))) (let ((.cse1 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse3 v_ArrVal_3216) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_3219))) (let ((.cse6 (select .cse1 |c_~#queue~0.base|))) (let ((.cse2 (store (store (store .cse6 .cse3 v_ArrVal_3221) .cse5 v_ArrVal_3223) (+ |c_~#queue~0.offset| (* (select .cse6 .cse4) 4)) v_ArrVal_3225))) (or (= 400 .cse0) (not (= 400 (select (select (store (store .cse1 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_3227) .cse4 v_ArrVal_3229)) |c_~#stored_elements~0.base| v_ArrVal_3230) |c_~#queue~0.base|) .cse5))) (< (+ (select .cse6 .cse5) 1) v_ArrVal_3223) (= 400 .cse7) (< (+ (select .cse8 .cse5) 1) v_ArrVal_3212) (= 400 (select .cse2 .cse4)))))))))))))) is different from false [2023-05-04 04:43:42,616 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3229 Int) (v_ArrVal_3205 Int) (v_ArrVal_3216 Int) (v_ArrVal_3227 Int) (v_ArrVal_3203 Int) (v_ArrVal_3214 Int) (v_ArrVal_3225 Int) (v_ArrVal_3212 Int) (v_ArrVal_3223 Int) (v_ArrVal_3210 Int) (v_ArrVal_3221 Int) (v_ArrVal_3230 (Array Int Int)) (v_ArrVal_3208 (Array Int Int)) (v_ArrVal_3219 (Array Int Int))) (let ((.cse12 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse11 (let ((.cse13 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse13 (+ (* (select .cse13 .cse12) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_3203)))) (let ((.cse6 (select .cse11 .cse12))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse11 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_3205) .cse12 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_3208))) (let ((.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ 1600 |c_~#queue~0.offset|)) (.cse5 (select .cse9 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse10 (store (store (store .cse5 .cse8 v_ArrVal_3210) .cse3 v_ArrVal_3212) (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_3214))) (let ((.cse4 (select .cse10 .cse1))) (let ((.cse7 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse8 v_ArrVal_3216) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_3219))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (store (store (store .cse2 .cse8 v_ArrVal_3221) .cse3 v_ArrVal_3223) (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_3225))) (or (= 400 (select .cse0 .cse1)) (< (+ (select .cse2 .cse3) 1) v_ArrVal_3223) (= 400 .cse4) (< (+ (select .cse5 .cse3) 1) v_ArrVal_3212) (= 400 .cse6) (not (= (select (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse8 v_ArrVal_3227) .cse1 v_ArrVal_3229)) |c_~#stored_elements~0.base| v_ArrVal_3230) |c_~#queue~0.base|) .cse3) 400)))))))))))))) is different from false Received shutdown request... [2023-05-04 04:43:56,643 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 04:43:56,644 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 04:43:56,644 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 04:43:56,644 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 04:43:56,644 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 04:43:56,735 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-05-04 04:43:56,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-05-04 04:43:56,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 04:43:56,936 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 1282 with TraceHistMax 15,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 287 known predicates. [2023-05-04 04:43:56,938 INFO L444 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1] [2023-05-04 04:43:56,938 INFO L307 ceAbstractionStarter]: Result for error location t2Thread1of1ForFork1 was TIMEOUT (3/3) [2023-05-04 04:43:56,939 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-04 04:43:56,939 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-04 04:43:56,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.05 04:43:56 BasicIcfg [2023-05-04 04:43:56,942 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-04 04:43:56,943 INFO L158 Benchmark]: Toolchain (without parser) took 793942.05ms. Allocated memory was 181.4MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 151.5MB in the beginning and 944.0MB in the end (delta: -792.5MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2023-05-04 04:43:56,943 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 181.4MB. Free memory is still 136.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-04 04:43:56,943 INFO L158 Benchmark]: CACSL2BoogieTranslator took 640.17ms. Allocated memory was 181.4MB in the beginning and 261.1MB in the end (delta: 79.7MB). Free memory was 151.2MB in the beginning and 208.6MB in the end (delta: -57.4MB). Peak memory consumption was 26.6MB. Max. memory is 8.0GB. [2023-05-04 04:43:56,943 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.66ms. Allocated memory is still 261.1MB. Free memory was 208.6MB in the beginning and 205.2MB in the end (delta: 3.3MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-05-04 04:43:56,943 INFO L158 Benchmark]: Boogie Preprocessor took 55.08ms. Allocated memory is still 261.1MB. Free memory was 205.2MB in the beginning and 203.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-04 04:43:56,944 INFO L158 Benchmark]: RCFGBuilder took 547.20ms. Allocated memory is still 261.1MB. Free memory was 202.8MB in the beginning and 180.3MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-05-04 04:43:56,944 INFO L158 Benchmark]: TraceAbstraction took 792619.63ms. Allocated memory was 261.1MB in the beginning and 2.2GB in the end (delta: 1.9GB). Free memory was 179.2MB in the beginning and 944.0MB in the end (delta: -764.8MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2023-05-04 04:43:56,945 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 181.4MB. Free memory is still 136.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 640.17ms. Allocated memory was 181.4MB in the beginning and 261.1MB in the end (delta: 79.7MB). Free memory was 151.2MB in the beginning and 208.6MB in the end (delta: -57.4MB). Peak memory consumption was 26.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 73.66ms. Allocated memory is still 261.1MB. Free memory was 208.6MB in the beginning and 205.2MB in the end (delta: 3.3MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.08ms. Allocated memory is still 261.1MB. Free memory was 205.2MB in the beginning and 203.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 547.20ms. Allocated memory is still 261.1MB. Free memory was 202.8MB in the beginning and 180.3MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 792619.63ms. Allocated memory was 261.1MB in the beginning and 2.2GB in the end (delta: 1.9GB). Free memory was 179.2MB in the beginning and 944.0MB in the end (delta: -764.8MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 31239, independent: 30023, independent conditional: 17201, independent unconditional: 12822, dependent: 1216, dependent conditional: 1142, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30207, independent: 30023, independent conditional: 17201, independent unconditional: 12822, dependent: 184, dependent conditional: 110, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 30207, independent: 30023, independent conditional: 17201, independent unconditional: 12822, dependent: 184, dependent conditional: 110, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30862, independent: 30023, independent conditional: 124, independent unconditional: 29899, dependent: 839, dependent conditional: 531, dependent unconditional: 308, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 30862, independent: 30023, independent conditional: 124, independent unconditional: 29899, dependent: 839, dependent conditional: 147, dependent unconditional: 692, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 30862, independent: 30023, independent conditional: 124, independent unconditional: 29899, dependent: 839, dependent conditional: 147, dependent unconditional: 692, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11543, independent: 11457, independent conditional: 14, independent unconditional: 11443, dependent: 86, dependent conditional: 12, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11543, independent: 11439, independent conditional: 0, independent unconditional: 11439, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 104, independent: 18, independent conditional: 14, independent unconditional: 4, dependent: 86, dependent conditional: 12, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 104, independent: 18, independent conditional: 14, independent unconditional: 4, dependent: 86, dependent conditional: 12, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 283, independent: 95, independent conditional: 43, independent unconditional: 53, dependent: 187, dependent conditional: 35, dependent unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 30862, independent: 18566, independent conditional: 110, independent unconditional: 18456, dependent: 753, dependent conditional: 135, dependent unconditional: 618, unknown: 11543, unknown conditional: 26, unknown unconditional: 11517] , Statistics on independence cache: Total cache size (in pairs): 11543, Positive cache size: 11457, Positive conditional cache size: 14, Positive unconditional cache size: 11443, Negative cache size: 86, Negative conditional cache size: 12, Negative unconditional cache size: 74, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 384, Maximal queried relation: 6, Independence queries for same thread: 1032 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.5s, Number of persistent set computation: 2799, Number of trivial persistent sets: 2645, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12896, independent: 12822, independent conditional: 0, independent unconditional: 12822, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 31239, independent: 30023, independent conditional: 17201, independent unconditional: 12822, dependent: 1216, dependent conditional: 1142, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30207, independent: 30023, independent conditional: 17201, independent unconditional: 12822, dependent: 184, dependent conditional: 110, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 30207, independent: 30023, independent conditional: 17201, independent unconditional: 12822, dependent: 184, dependent conditional: 110, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30862, independent: 30023, independent conditional: 124, independent unconditional: 29899, dependent: 839, dependent conditional: 531, dependent unconditional: 308, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 30862, independent: 30023, independent conditional: 124, independent unconditional: 29899, dependent: 839, dependent conditional: 147, dependent unconditional: 692, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 30862, independent: 30023, independent conditional: 124, independent unconditional: 29899, dependent: 839, dependent conditional: 147, dependent unconditional: 692, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11543, independent: 11457, independent conditional: 14, independent unconditional: 11443, dependent: 86, dependent conditional: 12, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11543, independent: 11439, independent conditional: 0, independent unconditional: 11439, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 104, independent: 18, independent conditional: 14, independent unconditional: 4, dependent: 86, dependent conditional: 12, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 104, independent: 18, independent conditional: 14, independent unconditional: 4, dependent: 86, dependent conditional: 12, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 283, independent: 95, independent conditional: 43, independent unconditional: 53, dependent: 187, dependent conditional: 35, dependent unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 30862, independent: 18566, independent conditional: 110, independent unconditional: 18456, dependent: 753, dependent conditional: 135, dependent unconditional: 618, unknown: 11543, unknown conditional: 26, unknown unconditional: 11517] , Statistics on independence cache: Total cache size (in pairs): 11543, Positive cache size: 11457, Positive conditional cache size: 14, Positive unconditional cache size: 11443, Negative cache size: 86, Negative conditional cache size: 12, Negative unconditional cache size: 74, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 384, Maximal queried relation: 6, Independence queries for same thread: 1032 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8603, independent: 8416, independent conditional: 238, independent unconditional: 8178, dependent: 187, dependent conditional: 112, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8531, independent: 8416, independent conditional: 238, independent unconditional: 8178, dependent: 115, dependent conditional: 40, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8531, independent: 8416, independent conditional: 238, independent unconditional: 8178, dependent: 115, dependent conditional: 40, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8551, independent: 8416, independent conditional: 0, independent unconditional: 8416, dependent: 135, dependent conditional: 20, dependent unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8551, independent: 8416, independent conditional: 0, independent unconditional: 8416, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8551, independent: 8416, independent conditional: 0, independent unconditional: 8416, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8115, independent: 8040, independent conditional: 0, independent unconditional: 8040, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8115, independent: 8036, independent conditional: 0, independent unconditional: 8036, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 79, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 79, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 133, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8551, independent: 376, independent conditional: 0, independent unconditional: 376, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 8115, unknown conditional: 0, unknown unconditional: 8115] , Statistics on independence cache: Total cache size (in pairs): 8115, Positive cache size: 8040, Positive conditional cache size: 0, Positive unconditional cache size: 8040, Negative cache size: 75, Negative conditional cache size: 0, Negative unconditional cache size: 75, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 1, Independence queries for same thread: 72 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 241, Number of trivial persistent sets: 210, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8253, independent: 8178, independent conditional: 0, independent unconditional: 8178, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8603, independent: 8416, independent conditional: 238, independent unconditional: 8178, dependent: 187, dependent conditional: 112, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8531, independent: 8416, independent conditional: 238, independent unconditional: 8178, dependent: 115, dependent conditional: 40, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8531, independent: 8416, independent conditional: 238, independent unconditional: 8178, dependent: 115, dependent conditional: 40, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8551, independent: 8416, independent conditional: 0, independent unconditional: 8416, dependent: 135, dependent conditional: 20, dependent unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8551, independent: 8416, independent conditional: 0, independent unconditional: 8416, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8551, independent: 8416, independent conditional: 0, independent unconditional: 8416, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8115, independent: 8040, independent conditional: 0, independent unconditional: 8040, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8115, independent: 8036, independent conditional: 0, independent unconditional: 8036, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 79, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 79, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 133, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8551, independent: 376, independent conditional: 0, independent unconditional: 376, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 8115, unknown conditional: 0, unknown unconditional: 8115] , Statistics on independence cache: Total cache size (in pairs): 8115, Positive cache size: 8040, Positive conditional cache size: 0, Positive unconditional cache size: 8040, Negative cache size: 75, Negative conditional cache size: 0, Negative unconditional cache size: 75, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 1, Independence queries for same thread: 72 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 47453, independent: 37379, independent conditional: 22283, independent unconditional: 15096, dependent: 10074, dependent conditional: 10007, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37955, independent: 37379, independent conditional: 22283, independent unconditional: 15096, dependent: 576, dependent conditional: 509, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 37955, independent: 37379, independent conditional: 22283, independent unconditional: 15096, dependent: 576, dependent conditional: 509, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42890, independent: 37379, independent conditional: 110, independent unconditional: 37269, dependent: 5511, dependent conditional: 4825, dependent unconditional: 686, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 42890, independent: 37379, independent conditional: 110, independent unconditional: 37269, dependent: 5511, dependent conditional: 502, dependent unconditional: 5009, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42890, independent: 37379, independent conditional: 110, independent unconditional: 37269, dependent: 5511, dependent conditional: 502, dependent unconditional: 5009, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12369, independent: 12299, independent conditional: 1, independent unconditional: 12298, dependent: 70, dependent conditional: 3, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12369, independent: 12291, independent conditional: 0, independent unconditional: 12291, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 78, independent: 8, independent conditional: 1, independent unconditional: 7, dependent: 70, dependent conditional: 3, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 78, independent: 8, independent conditional: 1, independent unconditional: 7, dependent: 70, dependent conditional: 3, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 115, independent: 32, independent conditional: 1, independent unconditional: 30, dependent: 83, dependent conditional: 3, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 42890, independent: 25080, independent conditional: 109, independent unconditional: 24971, dependent: 5441, dependent conditional: 499, dependent unconditional: 4942, unknown: 12369, unknown conditional: 4, unknown unconditional: 12365] , Statistics on independence cache: Total cache size (in pairs): 12369, Positive cache size: 12299, Positive conditional cache size: 1, Positive unconditional cache size: 12298, Negative cache size: 70, Negative conditional cache size: 3, Negative unconditional cache size: 67, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4323, Maximal queried relation: 10, Independence queries for same thread: 9498 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 463, Number of trivial persistent sets: 343, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15163, independent: 15096, independent conditional: 0, independent unconditional: 15096, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 47453, independent: 37379, independent conditional: 22283, independent unconditional: 15096, dependent: 10074, dependent conditional: 10007, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37955, independent: 37379, independent conditional: 22283, independent unconditional: 15096, dependent: 576, dependent conditional: 509, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 37955, independent: 37379, independent conditional: 22283, independent unconditional: 15096, dependent: 576, dependent conditional: 509, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42890, independent: 37379, independent conditional: 110, independent unconditional: 37269, dependent: 5511, dependent conditional: 4825, dependent unconditional: 686, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 42890, independent: 37379, independent conditional: 110, independent unconditional: 37269, dependent: 5511, dependent conditional: 502, dependent unconditional: 5009, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42890, independent: 37379, independent conditional: 110, independent unconditional: 37269, dependent: 5511, dependent conditional: 502, dependent unconditional: 5009, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12369, independent: 12299, independent conditional: 1, independent unconditional: 12298, dependent: 70, dependent conditional: 3, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12369, independent: 12291, independent conditional: 0, independent unconditional: 12291, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 78, independent: 8, independent conditional: 1, independent unconditional: 7, dependent: 70, dependent conditional: 3, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 78, independent: 8, independent conditional: 1, independent unconditional: 7, dependent: 70, dependent conditional: 3, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 115, independent: 32, independent conditional: 1, independent unconditional: 30, dependent: 83, dependent conditional: 3, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 42890, independent: 25080, independent conditional: 109, independent unconditional: 24971, dependent: 5441, dependent conditional: 499, dependent unconditional: 4942, unknown: 12369, unknown conditional: 4, unknown unconditional: 12365] , Statistics on independence cache: Total cache size (in pairs): 12369, Positive cache size: 12299, Positive conditional cache size: 1, Positive unconditional cache size: 12298, Negative cache size: 70, Negative conditional cache size: 3, Negative unconditional cache size: 67, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4323, Maximal queried relation: 10, Independence queries for same thread: 9498 - PositiveResult [Line: 1032]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1059]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 1282 with TraceHistMax 15,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 287 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t1Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 429 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 23.1s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 9.5s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 13.0s InterpolantComputationTime, 1005 NumberOfCodeBlocks, 1005 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 998 ConstructedInterpolants, 0 QuantifiedInterpolants, 16313 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 10/10 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 429 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 58 NumberOfCodeBlocks, 58 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 57 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t2Thread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 429 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 769.0s, OverallIterations: 11, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 108.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 441, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 158.1s InterpolantComputationTime, 8933 NumberOfCodeBlocks, 8659 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 12652 ConstructedInterpolants, 453 QuantifiedInterpolants, 567011 SizeOfPredicates, 145 NumberOfNonLiveVariables, 7414 ConjunctsInSsa, 401 ConjunctsInUnsatCore, 22 InterpolantComputations, 4 PerfectInterpolantSequences, 32430/38842 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown