/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 X --traceabstraction.defines.what.statements.are.considered.a.step.in.por LOOP -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_longer.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-32214ab [2023-05-20 15:31:08,608 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-20 15:31:08,609 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-20 15:31:08,635 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-20 15:31:08,636 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-20 15:31:08,638 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-20 15:31:08,640 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-20 15:31:08,644 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-20 15:31:08,645 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-20 15:31:08,649 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-20 15:31:08,650 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-20 15:31:08,651 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-20 15:31:08,651 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-20 15:31:08,652 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-20 15:31:08,653 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-20 15:31:08,654 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-20 15:31:08,655 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-20 15:31:08,655 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-20 15:31:08,656 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-20 15:31:08,660 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-20 15:31:08,661 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-20 15:31:08,662 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-20 15:31:08,663 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-20 15:31:08,663 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-20 15:31:08,668 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-20 15:31:08,668 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-20 15:31:08,669 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-20 15:31:08,670 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-20 15:31:08,670 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-20 15:31:08,670 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-20 15:31:08,671 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-20 15:31:08,671 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-20 15:31:08,672 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-20 15:31:08,673 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-20 15:31:08,673 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-20 15:31:08,674 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-20 15:31:08,674 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-20 15:31:08,674 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-20 15:31:08,674 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-20 15:31:08,675 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-20 15:31:08,675 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-20 15:31:08,676 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-20 15:31:08,703 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-20 15:31:08,704 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-20 15:31:08,704 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-20 15:31:08,704 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-20 15:31:08,705 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-20 15:31:08,705 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-20 15:31:08,705 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-20 15:31:08,705 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-20 15:31:08,705 INFO L138 SettingsManager]: * Use SBE=true [2023-05-20 15:31:08,705 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-20 15:31:08,706 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-20 15:31:08,706 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-20 15:31:08,706 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-20 15:31:08,706 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-20 15:31:08,706 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-20 15:31:08,707 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-20 15:31:08,707 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-20 15:31:08,707 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-20 15:31:08,707 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-20 15:31:08,707 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-20 15:31:08,707 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-20 15:31:08,707 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-20 15:31:08,707 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-20 15:31:08,707 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-20 15:31:08,707 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-20 15:31:08,707 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-20 15:31:08,707 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-20 15:31:08,708 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-20 15:31:08,708 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-20 15:31:08,708 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-20 15:31:08,708 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-20 15:31:08,708 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-20 15:31:08,708 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-20 15:31:08,708 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-20 15:31:08,708 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-20 15:31:08,708 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-20 15:31:08,709 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 -> X Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Defines what statements are considered a step in POR -> LOOP [2023-05-20 15:31:08,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-20 15:31:08,917 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-20 15:31:08,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-20 15:31:08,919 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-20 15:31:08,920 INFO L275 PluginConnector]: CDTParser initialized [2023-05-20 15:31:08,921 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-20 15:31:08,967 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/011b87dd6/ec2a213d724545228482483c644c0c49/FLAG715664486 [2023-05-20 15:31:09,439 INFO L306 CDTParser]: Found 1 translation units. [2023-05-20 15:31:09,440 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i [2023-05-20 15:31:09,458 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/011b87dd6/ec2a213d724545228482483c644c0c49/FLAG715664486 [2023-05-20 15:31:09,469 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/011b87dd6/ec2a213d724545228482483c644c0c49 [2023-05-20 15:31:09,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-20 15:31:09,471 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-20 15:31:09,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-20 15:31:09,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-20 15:31:09,479 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-20 15:31:09,479 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.05 03:31:09" (1/1) ... [2023-05-20 15:31:09,480 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ee64609 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 03:31:09, skipping insertion in model container [2023-05-20 15:31:09,480 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.05 03:31:09" (1/1) ... [2023-05-20 15:31:09,486 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-20 15:31:09,531 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-20 15:31:09,826 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-20 15:31:09,830 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-20 15:31:09,832 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-20 15:31:09,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-20 15:31:09,842 INFO L203 MainTranslator]: Completed pre-run [2023-05-20 15:31:09,875 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-20 15:31:09,876 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-20 15:31:09,878 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-20 15:31:09,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-20 15:31:09,922 INFO L208 MainTranslator]: Completed translation [2023-05-20 15:31:09,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 03:31:09 WrapperNode [2023-05-20 15:31:09,922 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-20 15:31:09,923 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-20 15:31:09,923 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-20 15:31:09,923 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-20 15:31:09,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 03:31:09" (1/1) ... [2023-05-20 15:31:09,966 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 03:31:09" (1/1) ... [2023-05-20 15:31:09,991 INFO L138 Inliner]: procedures = 274, calls = 62, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 243 [2023-05-20 15:31:09,991 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-20 15:31:09,992 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-20 15:31:09,992 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-20 15:31:09,992 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-20 15:31:09,998 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 03:31:09" (1/1) ... [2023-05-20 15:31:09,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 03:31:09" (1/1) ... [2023-05-20 15:31:10,001 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 03:31:09" (1/1) ... [2023-05-20 15:31:10,002 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 03:31:09" (1/1) ... [2023-05-20 15:31:10,017 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 03:31:09" (1/1) ... [2023-05-20 15:31:10,021 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 03:31:09" (1/1) ... [2023-05-20 15:31:10,023 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 03:31:09" (1/1) ... [2023-05-20 15:31:10,024 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 03:31:09" (1/1) ... [2023-05-20 15:31:10,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-20 15:31:10,026 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-20 15:31:10,027 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-20 15:31:10,027 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-20 15:31:10,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 03:31:09" (1/1) ... [2023-05-20 15:31:10,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-20 15:31:10,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 15:31:10,059 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-20 15:31:10,067 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-20 15:31:10,088 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-05-20 15:31:10,088 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-05-20 15:31:10,088 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-05-20 15:31:10,088 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-05-20 15:31:10,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-20 15:31:10,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-20 15:31:10,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-20 15:31:10,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-20 15:31:10,088 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-05-20 15:31:10,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-20 15:31:10,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-20 15:31:10,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-20 15:31:10,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-20 15:31:10,090 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-20 15:31:10,230 INFO L235 CfgBuilder]: Building ICFG [2023-05-20 15:31:10,231 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-20 15:31:10,565 INFO L276 CfgBuilder]: Performing block encoding [2023-05-20 15:31:10,572 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-20 15:31:10,572 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-05-20 15:31:10,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.05 03:31:10 BoogieIcfgContainer [2023-05-20 15:31:10,574 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-20 15:31:10,580 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-20 15:31:10,580 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-20 15:31:10,583 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-20 15:31:10,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.05 03:31:09" (1/3) ... [2023-05-20 15:31:10,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33aeb6e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.05 03:31:10, skipping insertion in model container [2023-05-20 15:31:10,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 03:31:09" (2/3) ... [2023-05-20 15:31:10,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33aeb6e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.05 03:31:10, skipping insertion in model container [2023-05-20 15:31:10,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.05 03:31:10" (3/3) ... [2023-05-20 15:31:10,586 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2023-05-20 15:31:10,593 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-20 15:31:10,600 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-20 15:31:10,600 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-05-20 15:31:10,600 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-20 15:31:10,708 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-05-20 15:31:10,778 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 15:31:10,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-20 15:31:10,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 15:31:10,780 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-20 15:31:10,788 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-20 15:31:10,816 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-20 15:31:10,841 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2023-05-20 15:31:10,847 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;@629d3c8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 15:31:10,847 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-20 15:31:11,093 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 15:31:11,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 15:31:11,098 INFO L85 PathProgramCache]: Analyzing trace with hash -9260326, now seen corresponding path program 1 times [2023-05-20 15:31:11,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 15:31:11,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239682197] [2023-05-20 15:31:11,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 15:31:11,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 15:31:11,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 15:31:11,369 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-20 15:31:11,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 15:31:11,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239682197] [2023-05-20 15:31:11,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239682197] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 15:31:11,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 15:31:11,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-20 15:31:11,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523008092] [2023-05-20 15:31:11,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 15:31:11,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-20 15:31:11,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 15:31:11,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-20 15:31:11,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-20 15:31:11,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:11,404 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 15:31:11,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 64.0) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 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-20 15:31:11,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:11,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:11,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-20 15:31:11,438 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 15:31:11,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 15:31:11,439 INFO L85 PathProgramCache]: Analyzing trace with hash -2098011526, now seen corresponding path program 1 times [2023-05-20 15:31:11,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 15:31:11,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285477679] [2023-05-20 15:31:11,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 15:31:11,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 15:31:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 15:31:11,717 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-20 15:31:11,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 15:31:11,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285477679] [2023-05-20 15:31:11,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285477679] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 15:31:11,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 15:31:11,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-05-20 15:31:11,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106303915] [2023-05-20 15:31:11,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 15:31:11,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-05-20 15:31:11,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 15:31:11,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-05-20 15:31:11,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-05-20 15:31:11,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:11,721 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 15:31:11,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 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-20 15:31:11,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:11,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:11,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:11,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-20 15:31:11,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-20 15:31:11,793 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 15:31:11,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 15:31:11,794 INFO L85 PathProgramCache]: Analyzing trace with hash 527174519, now seen corresponding path program 1 times [2023-05-20 15:31:11,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 15:31:11,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197000382] [2023-05-20 15:31:11,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 15:31:11,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 15:31:11,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 15:31:15,332 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-20 15:31:15,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 15:31:15,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197000382] [2023-05-20 15:31:15,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197000382] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 15:31:15,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 15:31:15,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2023-05-20 15:31:15,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360700292] [2023-05-20 15:31:15,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 15:31:15,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-05-20 15:31:15,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 15:31:15,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-05-20 15:31:15,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2023-05-20 15:31:15,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:15,343 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 15:31:15,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.535714285714286) internal successors, (127), 28 states have internal predecessors, (127), 0 states have call successors, (0), 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-20 15:31:15,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:15,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-20 15:31:15,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:17,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:17,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-20 15:31:17,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-05-20 15:31:17,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-05-20 15:31:17,816 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 15:31:17,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 15:31:17,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1896636181, now seen corresponding path program 1 times [2023-05-20 15:31:17,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 15:31:17,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190516040] [2023-05-20 15:31:17,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 15:31:17,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 15:31:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 15:31:17,948 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-20 15:31:17,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 15:31:17,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190516040] [2023-05-20 15:31:17,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190516040] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 15:31:17,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 15:31:17,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-20 15:31:17,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747192239] [2023-05-20 15:31:17,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 15:31:17,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-20 15:31:17,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 15:31:17,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-20 15:31:17,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-20 15:31:17,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:17,950 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 15:31:17,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 15:31:17,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:17,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-20 15:31:17,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-05-20 15:31:17,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:17,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:17,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-20 15:31:17,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-05-20 15:31:17,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:31:17,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-05-20 15:31:17,968 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 15:31:17,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 15:31:17,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1500096164, now seen corresponding path program 1 times [2023-05-20 15:31:17,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 15:31:17,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759060081] [2023-05-20 15:31:17,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 15:31:17,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 15:31:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 15:31:18,025 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-20 15:31:18,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 15:31:18,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759060081] [2023-05-20 15:31:18,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759060081] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 15:31:18,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 15:31:18,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-05-20 15:31:18,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294194130] [2023-05-20 15:31:18,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 15:31:18,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-05-20 15:31:18,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 15:31:18,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-05-20 15:31:18,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-05-20 15:31:18,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:18,027 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 15:31:18,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 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-20 15:31:18,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:18,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-20 15:31:18,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-05-20 15:31:18,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:31:18,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:18,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:18,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-20 15:31:18,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-05-20 15:31:18,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:31:18,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-20 15:31:18,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-05-20 15:31:18,234 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 15:31:18,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 15:31:18,234 INFO L85 PathProgramCache]: Analyzing trace with hash 144989092, now seen corresponding path program 1 times [2023-05-20 15:31:18,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 15:31:18,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114055237] [2023-05-20 15:31:18,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 15:31:18,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 15:31:18,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 15:31:18,332 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-20 15:31:18,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 15:31:18,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114055237] [2023-05-20 15:31:18,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114055237] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 15:31:18,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 15:31:18,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-20 15:31:18,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787681591] [2023-05-20 15:31:18,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 15:31:18,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-20 15:31:18,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 15:31:18,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-20 15:31:18,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-20 15:31:18,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:18,334 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 15:31:18,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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-20 15:31:18,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:18,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-20 15:31:18,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-05-20 15:31:18,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:31:18,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-20 15:31:18,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:18,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:18,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-20 15:31:18,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-20 15:31:18,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:31:18,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-20 15:31:18,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:31:18,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-05-20 15:31:18,820 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 15:31:18,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 15:31:18,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1636882583, now seen corresponding path program 1 times [2023-05-20 15:31:18,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 15:31:18,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252792419] [2023-05-20 15:31:18,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 15:31:18,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 15:31:18,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 15:31:19,150 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-20 15:31:19,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 15:31:19,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252792419] [2023-05-20 15:31:19,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252792419] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 15:31:19,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 15:31:19,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-05-20 15:31:19,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61049616] [2023-05-20 15:31:19,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 15:31:19,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-05-20 15:31:19,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 15:31:19,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-05-20 15:31:19,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-05-20 15:31:19,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:19,152 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 15:31:19,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.5) internal successors, (126), 12 states have internal predecessors, (126), 0 states have call successors, (0), 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-20 15:31:19,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:19,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-20 15:31:19,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-20 15:31:19,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:31:19,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-20 15:31:19,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:31:19,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:19,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:19,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-20 15:31:19,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-20 15:31:19,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:31:19,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-20 15:31:19,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:31:19,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 15:31:19,485 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-05-20 15:31:19,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-05-20 15:31:19,490 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-05-20 15:31:19,491 INFO L307 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork0 was SAFE (1/3) [2023-05-20 15:31:19,494 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 15:31:19,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-20 15:31:19,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 15:31:19,496 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-20 15:31:19,534 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-20 15:31:19,536 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-20 15:31:19,536 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;@629d3c8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 15:31:19,537 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-05-20 15:31:19,538 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-20 15:31:19,556 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-20 15:31:19,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 15:31:19,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1751721974, now seen corresponding path program 1 times [2023-05-20 15:31:19,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 15:31:19,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110328927] [2023-05-20 15:31:19,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 15:31:19,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 15:31:19,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 15:31:19,571 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-20 15:31:19,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 15:31:19,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110328927] [2023-05-20 15:31:19,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110328927] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 15:31:19,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 15:31:19,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-20 15:31:19,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431454844] [2023-05-20 15:31:19,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 15:31:19,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-20 15:31:19,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 15:31:19,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-20 15:31:19,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-20 15:31:19,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:19,574 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 15:31:19,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 15:31:19,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:19,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:19,758 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-05-20 15:31:19,758 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-05-20 15:31:19,758 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-05-20 15:31:19,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-05-20 15:31:19,760 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2023-05-20 15:31:19,760 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE,SAFE (2/3) [2023-05-20 15:31:19,762 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 15:31:19,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-20 15:31:19,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 15:31:19,764 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-20 15:31:19,766 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-20 15:31:19,767 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork1 ======== [2023-05-20 15:31:19,767 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;@629d3c8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 15:31:19,767 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-20 15:31:19,772 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-20 15:31:19,902 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 15:31:19,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 15:31:19,903 INFO L85 PathProgramCache]: Analyzing trace with hash -637201750, now seen corresponding path program 1 times [2023-05-20 15:31:19,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 15:31:19,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791768934] [2023-05-20 15:31:19,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 15:31:19,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 15:31:19,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 15:31:19,941 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-20 15:31:19,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 15:31:19,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791768934] [2023-05-20 15:31:19,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791768934] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 15:31:19,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 15:31:19,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-20 15:31:19,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385704556] [2023-05-20 15:31:19,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 15:31:19,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-20 15:31:19,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 15:31:19,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-20 15:31:19,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-20 15:31:19,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:19,944 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 15:31:19,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 86.5) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 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-20 15:31:19,944 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:19,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:19,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-05-20 15:31:19,952 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 15:31:19,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 15:31:19,953 INFO L85 PathProgramCache]: Analyzing trace with hash -465713398, now seen corresponding path program 1 times [2023-05-20 15:31:19,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 15:31:19,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733756337] [2023-05-20 15:31:19,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 15:31:19,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 15:31:19,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 15:31:20,046 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-20 15:31:20,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 15:31:20,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733756337] [2023-05-20 15:31:20,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733756337] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 15:31:20,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 15:31:20,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-20 15:31:20,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618251465] [2023-05-20 15:31:20,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 15:31:20,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-20 15:31:20,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 15:31:20,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-20 15:31:20,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-20 15:31:20,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:20,048 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 15:31:20,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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-20 15:31:20,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:20,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:20,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:20,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:31:20,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-05-20 15:31:20,082 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 15:31:20,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 15:31:20,083 INFO L85 PathProgramCache]: Analyzing trace with hash 651078198, now seen corresponding path program 1 times [2023-05-20 15:31:20,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 15:31:20,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273431971] [2023-05-20 15:31:20,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 15:31:20,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 15:31:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 15:33:19,873 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-20 15:33:19,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 15:33:19,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273431971] [2023-05-20 15:33:19,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273431971] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 15:33:19,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 15:33:19,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2023-05-20 15:33:19,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934533219] [2023-05-20 15:33:19,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 15:33:19,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-05-20 15:33:19,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 15:33:19,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-05-20 15:33:19,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2549, Unknown=0, NotChecked=0, Total=2756 [2023-05-20 15:33:19,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:33:19,876 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 15:33:19,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 3.849056603773585) internal successors, (204), 53 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 15:33:19,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:33:19,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:33:19,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:34:31,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-05-20 15:34:37,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:34:37,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:34:37,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-05-20 15:34:37,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-05-20 15:34:37,297 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 15:34:37,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 15:34:37,297 INFO L85 PathProgramCache]: Analyzing trace with hash -273997808, now seen corresponding path program 1 times [2023-05-20 15:34:37,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 15:34:37,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513427204] [2023-05-20 15:34:37,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 15:34:37,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 15:34:37,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 15:34:41,750 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-05-20 15:34:41,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 15:34:41,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513427204] [2023-05-20 15:34:41,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513427204] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 15:34:41,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 15:34:41,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2023-05-20 15:34:41,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414504702] [2023-05-20 15:34:41,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 15:34:41,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-05-20 15:34:41,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 15:34:41,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-05-20 15:34:41,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1166, Unknown=0, NotChecked=0, Total=1332 [2023-05-20 15:34:41,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:34:41,752 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 15:34:41,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 7.45945945945946) internal successors, (276), 37 states have internal predecessors, (276), 0 states have call successors, (0), 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-20 15:34:41,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:34:41,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:34:41,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2023-05-20 15:34:41,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:34:45,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:34:45,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:34:45,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-05-20 15:34:45,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-05-20 15:34:45,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-05-20 15:34:45,437 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 15:34:45,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 15:34:45,437 INFO L85 PathProgramCache]: Analyzing trace with hash 345149873, now seen corresponding path program 1 times [2023-05-20 15:34:45,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 15:34:45,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211105174] [2023-05-20 15:34:45,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 15:34:45,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 15:34:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 15:34:51,689 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-20 15:34:51,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 15:34:51,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211105174] [2023-05-20 15:34:51,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211105174] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 15:34:51,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 15:34:51,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2023-05-20 15:34:51,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637856691] [2023-05-20 15:34:51,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 15:34:51,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-05-20 15:34:51,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 15:34:51,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-05-20 15:34:51,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=2082, Unknown=0, NotChecked=0, Total=2256 [2023-05-20 15:34:51,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:34:51,691 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 15:34:51,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 4.333333333333333) internal successors, (208), 48 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 15:34:51,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:34:51,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:34:51,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2023-05-20 15:34:51,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2023-05-20 15:34:51,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:34:59,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:34:59,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:34:59,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-05-20 15:34:59,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-05-20 15:34:59,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2023-05-20 15:34:59,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-05-20 15:34:59,410 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 15:34:59,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 15:34:59,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1080445749, now seen corresponding path program 1 times [2023-05-20 15:34:59,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 15:34:59,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487144656] [2023-05-20 15:34:59,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 15:34:59,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 15:34:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 15:35:06,019 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 15:35:06,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 15:35:06,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487144656] [2023-05-20 15:35:06,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487144656] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 15:35:06,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767509441] [2023-05-20 15:35:06,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 15:35:06,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 15:35:06,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 15:35:06,021 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-20 15:35:06,052 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-20 15:35:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 15:35:06,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 137 conjunts are in the unsatisfiable core [2023-05-20 15:35:06,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 15:35:06,426 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-05-20 15:35:06,427 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-20 15:35:06,503 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-05-20 15:35:06,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-05-20 15:35:06,747 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-20 15:35:06,811 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-20 15:35:07,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-20 15:35:07,579 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-20 15:35:07,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 15:35:07,989 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-20 15:35:08,003 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-05-20 15:35:08,003 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-20 15:35:08,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 15:35:08,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 15:35:08,064 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-20 15:35:08,307 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 46 treesize of output 27 [2023-05-20 15:35:08,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 15:35:08,424 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 33 treesize of output 31 [2023-05-20 15:35:09,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 15:35:09,190 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-20 15:35:09,202 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-05-20 15:35:09,202 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 51 treesize of output 41 [2023-05-20 15:35:09,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 15:35:09,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 15:35:09,260 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 40 treesize of output 36 [2023-05-20 15:35:09,528 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-20 15:35:09,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 15:35:09,649 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-20 15:35:10,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 15:35:10,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 15:35:10,009 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-20 15:35:10,245 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 43 treesize of output 30 [2023-05-20 15:35:10,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 15:35:10,766 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-20 15:35:10,779 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-05-20 15:35:10,779 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-20 15:35:10,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 15:35:10,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 15:35:10,838 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-20 15:35:10,940 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-20 15:35:11,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 15:35:11,034 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-20 15:35:11,231 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-20 15:35:11,241 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-20 15:35:11,275 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 15:35:11,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 15:36:46,916 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_620 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_618 Int) (v_ArrVal_619 (Array Int Int)) (v_ArrVal_628 Int) (v_ArrVal_626 Int) (v_ArrVal_630 (Array Int Int)) (v_ArrVal_624 Int) (v_ArrVal_622 Int)) (let ((.cse3 (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_618)) |c_~#stored_elements~0.base| v_ArrVal_619))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (+ 1600 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse0 .cse1))) (not (<= v_ArrVal_618 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (< (+ (select .cse0 .cse2) 1) v_ArrVal_622) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store (let ((.cse4 (+ 1608 |c_~#queue~0.offset|))) (store (store (store (store .cse0 .cse4 v_ArrVal_620) .cse2 v_ArrVal_622) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_624) .cse4 v_ArrVal_626)) .cse1 v_ArrVal_628)) |c_~#stored_elements~0.base| v_ArrVal_630) |c_~#queue~0.base|) .cse2) 400))))) is different from false [2023-05-20 15:36:46,940 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_620 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_618 Int) (v_ArrVal_619 (Array Int Int)) (v_ArrVal_628 Int) (v_ArrVal_626 Int) (v_ArrVal_630 (Array Int Int)) (v_ArrVal_624 Int) (v_ArrVal_622 Int)) (let ((.cse3 (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_618)) |c_~#stored_elements~0.base| v_ArrVal_619))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (+ 1600 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse0 .cse1))) (< (+ (select .cse0 .cse2) 1) v_ArrVal_622) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store (let ((.cse4 (+ 1608 |c_~#queue~0.offset|))) (store (store (store (store .cse0 .cse4 v_ArrVal_620) .cse2 v_ArrVal_622) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_624) .cse4 v_ArrVal_626)) .cse1 v_ArrVal_628)) |c_~#stored_elements~0.base| v_ArrVal_630) |c_~#queue~0.base|) .cse2) 400) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_618))))) is different from false [2023-05-20 15:36:46,963 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_620 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_618 Int) (v_ArrVal_619 (Array Int Int)) (v_ArrVal_628 Int) (v_ArrVal_626 Int) (v_ArrVal_630 (Array Int Int)) (v_ArrVal_624 Int) (v_ArrVal_622 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_618)) |c_~#stored_elements~0.base| v_ArrVal_619))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse4 (+ 1600 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_618) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse2 .cse3))) (< (+ (select .cse2 .cse4) 1) v_ArrVal_622) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (let ((.cse6 (+ 1608 |c_~#queue~0.offset|))) (store (store (store (store .cse2 .cse6 v_ArrVal_620) .cse4 v_ArrVal_622) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_624) .cse6 v_ArrVal_626)) .cse3 v_ArrVal_628)) |c_~#stored_elements~0.base| v_ArrVal_630) |c_~#queue~0.base|) .cse4) 400)))))) is different from false [2023-05-20 15:36:47,075 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_620 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_618 Int) (v_ArrVal_619 (Array Int Int)) (v_ArrVal_628 Int) (v_ArrVal_615 Int) (v_ArrVal_626 Int) (v_ArrVal_630 (Array Int Int)) (v_ArrVal_624 Int) (v_ArrVal_622 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_615) .cse1 v_ArrVal_618)) |c_~#stored_elements~0.base| v_ArrVal_619))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse4 (+ 1600 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_618) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse2 .cse3))) (< (+ (select .cse2 .cse4) 1) v_ArrVal_622) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (let ((.cse6 (+ 1608 |c_~#queue~0.offset|))) (store (store (store (store .cse2 .cse6 v_ArrVal_620) .cse4 v_ArrVal_622) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_624) .cse6 v_ArrVal_626)) .cse3 v_ArrVal_628)) |c_~#stored_elements~0.base| v_ArrVal_630) |c_~#queue~0.base|) .cse4) 400)))))) is different from false [2023-05-20 15:36:47,175 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_620 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_618 Int) (v_ArrVal_619 (Array Int Int)) (v_ArrVal_628 Int) (v_ArrVal_615 Int) (v_ArrVal_626 Int) (v_ArrVal_630 (Array Int Int)) (v_ArrVal_613 Int) (v_ArrVal_624 Int) (v_ArrVal_622 Int)) (let ((.cse0 (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_613)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_615) .cse1 v_ArrVal_618)) |c_~#stored_elements~0.base| v_ArrVal_619))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse4 (+ 1600 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_618) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse2 .cse3))) (< (+ (select .cse2 .cse4) 1) v_ArrVal_622) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (let ((.cse6 (+ 1608 |c_~#queue~0.offset|))) (store (store (store (store .cse2 .cse6 v_ArrVal_620) .cse4 v_ArrVal_622) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_624) .cse6 v_ArrVal_626)) .cse3 v_ArrVal_628)) |c_~#stored_elements~0.base| v_ArrVal_630) |c_~#queue~0.base|) .cse4) 400)))))) is different from false [2023-05-20 15:36:47,214 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (forall ((v_ArrVal_620 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_618 Int) (v_ArrVal_619 (Array Int Int)) (v_ArrVal_628 Int) (v_ArrVal_615 Int) (v_ArrVal_626 Int) (v_ArrVal_630 (Array Int Int)) (v_ArrVal_613 Int) (v_ArrVal_624 Int) (v_ArrVal_622 Int)) (let ((.cse0 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_613))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_615) .cse1 v_ArrVal_618)) |c_~#stored_elements~0.base| v_ArrVal_619))) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse2 (select .cse4 |c_~#queue~0.base|)) (.cse6 (+ 1600 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_618) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse2 .cse3))) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (let ((.cse5 (+ 1608 |c_~#queue~0.offset|))) (store (store (store (store .cse2 .cse5 v_ArrVal_620) .cse6 v_ArrVal_622) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_624) .cse5 v_ArrVal_626)) .cse3 v_ArrVal_628)) |c_~#stored_elements~0.base| v_ArrVal_630) |c_~#queue~0.base|) .cse6) 400) (< (+ (select .cse2 .cse6) 1) v_ArrVal_622)))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse7 .cse1)))))) is different from false [2023-05-20 15:36:47,288 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_618 Int) (v_ArrVal_628 Int) (v_ArrVal_615 Int) (v_ArrVal_626 Int) (v_ArrVal_630 (Array Int Int)) (v_ArrVal_613 Int) (v_ArrVal_624 Int) (v_ArrVal_622 Int) (v_ArrVal_620 Int) (v_ArrVal_619 (Array Int Int))) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_613)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_615) .cse1 v_ArrVal_618)) |c_~#stored_elements~0.base| v_ArrVal_619))) (let ((.cse5 (+ 1600 |c_~#queue~0.offset|)) (.cse3 (select .cse2 |c_~#queue~0.base|)) (.cse6 (+ |c_~#queue~0.offset| 1604))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_618) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (let ((.cse4 (+ 1608 |c_~#queue~0.offset|))) (store (store (store (store .cse3 .cse4 v_ArrVal_620) .cse5 v_ArrVal_622) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_624) .cse4 v_ArrVal_626)) .cse6 v_ArrVal_628)) |c_~#stored_elements~0.base| v_ArrVal_630) |c_~#queue~0.base|) .cse5) 400) (< (+ (select .cse3 .cse5) 1) v_ArrVal_622) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse7 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse3 .cse6))))))))) is different from false [2023-05-20 15:37:43,100 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_618 Int) (v_ArrVal_628 Int) (v_ArrVal_615 Int) (v_ArrVal_626 Int) (v_ArrVal_630 (Array Int Int)) (v_ArrVal_613 Int) (v_ArrVal_624 Int) (v_ArrVal_622 Int) (v_ArrVal_612 (Array Int Int)) (v_ArrVal_620 Int) (v_ArrVal_619 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_612))) (let ((.cse6 (select .cse8 |c_~#queue~0.base|))) (let ((.cse7 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_613)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (store (store .cse8 |c_~#queue~0.base| (store (store .cse7 .cse2 v_ArrVal_615) .cse4 v_ArrVal_618)) |c_~#stored_elements~0.base| v_ArrVal_619))) (let ((.cse3 (+ 1600 |c_~#queue~0.offset|)) (.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse5 (select .cse6 .cse4))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store (store .cse1 .cse2 v_ArrVal_620) .cse3 v_ArrVal_622) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_624) .cse2 v_ArrVal_626) .cse4 v_ArrVal_628)) |c_~#stored_elements~0.base| v_ArrVal_630) |c_~#queue~0.base|) .cse3) 400) (< (+ (select .cse1 .cse3) 1) v_ArrVal_622) (= .cse5 (select .cse6 .cse3)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse1 .cse4))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| .cse5)) (< (+ (select .cse7 .cse4) 1) v_ArrVal_618)))))))) is different from false [2023-05-20 15:37:43,431 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_618 Int) (v_ArrVal_628 Int) (v_ArrVal_615 Int) (v_ArrVal_626 Int) (v_ArrVal_630 (Array Int Int)) (v_ArrVal_613 Int) (v_ArrVal_624 Int) (v_ArrVal_622 Int) (v_ArrVal_612 (Array Int Int)) (v_ArrVal_620 Int) (v_ArrVal_619 (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) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_612))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse3 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_613)) (.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (store (store .cse8 |c_~#queue~0.base| (store (store .cse3 .cse6 v_ArrVal_615) .cse4 v_ArrVal_618)) |c_~#stored_elements~0.base| v_ArrVal_619))) (let ((.cse1 (select .cse5 |c_~#queue~0.base|)) (.cse0 (select .cse7 .cse4)) (.cse2 (+ 1600 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| .cse0)) (< (+ (select .cse1 .cse2) 1) v_ArrVal_622) (< (+ (select .cse3 .cse4) 1) v_ArrVal_618) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse1 .cse4))) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store (store (store (store .cse1 .cse6 v_ArrVal_620) .cse2 v_ArrVal_622) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_624) .cse6 v_ArrVal_626) .cse4 v_ArrVal_628)) |c_~#stored_elements~0.base| v_ArrVal_630) |c_~#queue~0.base|) .cse2) 400) (= .cse0 (select .cse7 .cse2))))))))) is different from false [2023-05-20 15:37:43,497 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_618 Int) (v_ArrVal_628 Int) (v_ArrVal_615 Int) (v_ArrVal_626 Int) (v_ArrVal_630 (Array Int Int)) (v_ArrVal_613 Int) (v_ArrVal_624 Int) (v_ArrVal_622 Int) (v_ArrVal_612 (Array Int Int)) (v_ArrVal_620 Int) (v_ArrVal_619 (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_612))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse1 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_613)) (.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (store (store .cse8 |c_~#queue~0.base| (store (store .cse1 .cse6 v_ArrVal_615) .cse2 v_ArrVal_618)) |c_~#stored_elements~0.base| v_ArrVal_619))) (let ((.cse3 (select .cse5 |c_~#queue~0.base|)) (.cse4 (+ 1600 |c_~#queue~0.offset|)) (.cse0 (select .cse7 .cse2))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| .cse0)) (< (+ (select .cse1 .cse2) 1) v_ArrVal_618) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse3 .cse2))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_622) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store (store (store (store .cse3 .cse6 v_ArrVal_620) .cse4 v_ArrVal_622) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_624) .cse6 v_ArrVal_626) .cse2 v_ArrVal_628)) |c_~#stored_elements~0.base| v_ArrVal_630) |c_~#queue~0.base|) .cse4) 400) (= (select .cse7 .cse4) .cse0)))))))) is different from false [2023-05-20 15:37:43,547 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_618 Int) (v_ArrVal_628 Int) (v_ArrVal_615 Int) (v_ArrVal_626 Int) (v_ArrVal_630 (Array Int Int)) (v_ArrVal_613 Int) (v_ArrVal_624 Int) (v_ArrVal_622 Int) (v_ArrVal_612 (Array Int Int)) (v_ArrVal_620 Int) (v_ArrVal_619 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_612))) (let ((.cse4 (select .cse8 |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_613)) (.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse6 (store (store .cse8 |c_~#queue~0.base| (store (store .cse3 .cse7 v_ArrVal_615) .cse1 v_ArrVal_618)) |c_~#stored_elements~0.base| v_ArrVal_619))) (let ((.cse2 (select .cse4 .cse1)) (.cse0 (select .cse6 |c_~#queue~0.base|)) (.cse5 (+ 1600 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| .cse2)) (< (+ (select .cse3 .cse1) 1) v_ArrVal_618) (= (select .cse4 .cse5) .cse2) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store (store (store (store (store .cse0 .cse7 v_ArrVal_620) .cse5 v_ArrVal_622) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_624) .cse7 v_ArrVal_626) .cse1 v_ArrVal_628)) |c_~#stored_elements~0.base| v_ArrVal_630) |c_~#queue~0.base|) .cse5) 400) (< (+ (select .cse0 .cse5) 1) v_ArrVal_622)))))))) is different from false [2023-05-20 15:37:43,805 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_608 Int) (v_ArrVal_618 Int) (v_ArrVal_628 Int) (v_ArrVal_615 Int) (v_ArrVal_626 Int) (v_ArrVal_630 (Array Int Int)) (v_ArrVal_613 Int) (v_ArrVal_624 Int) (v_ArrVal_622 Int) (v_ArrVal_612 (Array Int Int)) (v_ArrVal_620 Int) (v_ArrVal_619 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse9 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_608) .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_612))) (let ((.cse3 (select .cse8 |c_~#queue~0.base|))) (let ((.cse0 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_613)) (.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse6 (store (store .cse8 |c_~#queue~0.base| (store (store .cse0 .cse7 v_ArrVal_615) .cse1 v_ArrVal_618)) |c_~#stored_elements~0.base| v_ArrVal_619))) (let ((.cse2 (select .cse3 .cse1)) (.cse5 (select .cse6 |c_~#queue~0.base|)) (.cse4 (+ 1600 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_618) (= .cse2 (select .cse3 .cse4)) (< (+ (select .cse5 .cse4) 1) v_ArrVal_622) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| .cse2)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse5 .cse1))) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store (store (store (store (store .cse5 .cse7 v_ArrVal_620) .cse4 v_ArrVal_622) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_624) .cse7 v_ArrVal_626) .cse1 v_ArrVal_628)) |c_~#stored_elements~0.base| v_ArrVal_630) |c_~#queue~0.base|) .cse4) 400)))))))) is different from false [2023-05-20 15:37:44,026 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_608 Int) (v_ArrVal_618 Int) (v_ArrVal_606 Int) (v_ArrVal_628 Int) (v_ArrVal_615 Int) (v_ArrVal_626 Int) (v_ArrVal_630 (Array Int Int)) (v_ArrVal_613 Int) (v_ArrVal_624 Int) (v_ArrVal_622 Int) (v_ArrVal_612 (Array Int Int)) (v_ArrVal_620 Int) (v_ArrVal_619 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (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_606)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse9 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_608) .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_612))) (let ((.cse4 (select .cse8 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_613)) (.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse6 (store (store .cse8 |c_~#queue~0.base| (store (store .cse2 .cse7 v_ArrVal_615) .cse1 v_ArrVal_618)) |c_~#stored_elements~0.base| v_ArrVal_619))) (let ((.cse3 (select .cse4 .cse1)) (.cse0 (select .cse6 |c_~#queue~0.base|)) (.cse5 (+ 1600 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_618) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| .cse3)) (= .cse3 (select .cse4 .cse5)) (< (+ (select .cse0 .cse5) 1) v_ArrVal_622) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store (store (store (store (store .cse0 .cse7 v_ArrVal_620) .cse5 v_ArrVal_622) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_624) .cse7 v_ArrVal_626) .cse1 v_ArrVal_628)) |c_~#stored_elements~0.base| v_ArrVal_630) |c_~#queue~0.base|) .cse5) 400)))))))) is different from false [2023-05-20 15:37:44,112 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse0 .cse1))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_608 Int) (v_ArrVal_618 Int) (v_ArrVal_606 Int) (v_ArrVal_628 Int) (v_ArrVal_615 Int) (v_ArrVal_626 Int) (v_ArrVal_630 (Array Int Int)) (v_ArrVal_613 Int) (v_ArrVal_624 Int) (v_ArrVal_622 Int) (v_ArrVal_612 (Array Int Int)) (v_ArrVal_620 Int) (v_ArrVal_619 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse11 (store .cse0 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_606))) (store (store .cse11 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_608) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_612))) (let ((.cse8 (select .cse10 |c_~#queue~0.base|))) (let ((.cse7 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_613)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (store (store .cse10 |c_~#queue~0.base| (store (store .cse7 .cse5 v_ArrVal_615) .cse3 v_ArrVal_618)) |c_~#stored_elements~0.base| v_ArrVal_619))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|)) (.cse6 (+ 1600 |c_~#queue~0.offset|)) (.cse9 (select .cse8 .cse3))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse2 .cse3))) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store (store .cse2 .cse5 v_ArrVal_620) .cse6 v_ArrVal_622) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_624) .cse5 v_ArrVal_626) .cse3 v_ArrVal_628)) |c_~#stored_elements~0.base| v_ArrVal_630) |c_~#queue~0.base|) .cse6) 400) (< (+ (select .cse2 .cse6) 1) v_ArrVal_622) (< (+ (select .cse7 .cse3) 1) v_ArrVal_618) (= (select .cse8 .cse6) .cse9) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| .cse9)))))))))))) is different from false [2023-05-20 15:37:44,254 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_608 Int) (v_ArrVal_618 Int) (v_ArrVal_606 Int) (v_ArrVal_628 Int) (v_ArrVal_615 Int) (v_ArrVal_626 Int) (v_ArrVal_630 (Array Int Int)) (v_ArrVal_613 Int) (v_ArrVal_624 Int) (v_ArrVal_622 Int) (v_ArrVal_612 (Array Int Int)) (v_ArrVal_620 Int) (v_ArrVal_619 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int)) (let ((.cse9 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604)) (.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse11 (store .cse8 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_606))) (store (store .cse11 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_608) .cse9 (+ (select .cse11 .cse9) 1)))) |c_~#stored_elements~0.base| v_ArrVal_612))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse2 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_613)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (store (store .cse10 |c_~#queue~0.base| (store (store .cse2 .cse4 v_ArrVal_615) .cse1 v_ArrVal_618)) |c_~#stored_elements~0.base| v_ArrVal_619))) (let ((.cse6 (select .cse7 .cse1)) (.cse0 (select .cse3 |c_~#queue~0.base|)) (.cse5 (+ 1600 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_618) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store (store (store (store (store .cse0 .cse4 v_ArrVal_620) .cse5 v_ArrVal_622) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_624) .cse4 v_ArrVal_626) .cse1 v_ArrVal_628)) |c_~#stored_elements~0.base| v_ArrVal_630) |c_~#queue~0.base|) .cse5) 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| .cse6)) (= (select .cse7 .cse5) .cse6) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse8 .cse9))) (< (+ (select .cse0 .cse5) 1) v_ArrVal_622))))))))) is different from false [2023-05-20 15:38:08,751 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_608 Int) (v_ArrVal_618 Int) (v_ArrVal_606 Int) (v_ArrVal_628 Int) (v_ArrVal_615 Int) (v_ArrVal_626 Int) (v_ArrVal_630 (Array Int Int)) (v_ArrVal_613 Int) (v_ArrVal_624 Int) (v_ArrVal_622 Int) (v_ArrVal_612 (Array Int Int)) (v_ArrVal_620 Int) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_619 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_605))) (let ((.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse0 (select .cse10 |c_~#queue~0.base|))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_606))) (store (store .cse11 .cse7 v_ArrVal_608) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_612))) (let ((.cse3 (select .cse9 |c_~#queue~0.base|))) (let ((.cse8 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_613))) (let ((.cse6 (store (store .cse9 |c_~#queue~0.base| (store (store .cse8 .cse7 v_ArrVal_615) .cse1 v_ArrVal_618)) |c_~#stored_elements~0.base| v_ArrVal_619))) (let ((.cse2 (select .cse3 .cse1)) (.cse5 (select .cse6 |c_~#queue~0.base|)) (.cse4 (+ 1600 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| .cse2)) (= .cse2 (select .cse3 .cse4)) (< (+ (select .cse5 .cse4) 1) v_ArrVal_622) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse5 .cse1))) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store (store (store (store (store .cse5 .cse7 v_ArrVal_620) .cse4 v_ArrVal_622) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_624) .cse7 v_ArrVal_626) .cse1 v_ArrVal_628)) |c_~#stored_elements~0.base| v_ArrVal_630) |c_~#queue~0.base|) .cse4) 400) (< (+ (select .cse8 .cse1) 1) v_ArrVal_618)))))))))) is different from false [2023-05-20 15:38:09,026 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_608 Int) (v_ArrVal_618 Int) (v_ArrVal_606 Int) (v_ArrVal_628 Int) (v_ArrVal_615 Int) (v_ArrVal_626 Int) (v_ArrVal_630 (Array Int Int)) (v_ArrVal_613 Int) (v_ArrVal_624 Int) (v_ArrVal_622 Int) (v_ArrVal_612 (Array Int Int)) (v_ArrVal_620 Int) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_619 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int)) (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_604) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_605))) (let ((.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_606))) (store (store .cse11 .cse6 v_ArrVal_608) .cse4 (+ (select .cse11 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_612))) (let ((.cse1 (select .cse9 |c_~#queue~0.base|))) (let ((.cse8 (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_613))) (let ((.cse5 (store (store .cse9 |c_~#queue~0.base| (store (store .cse8 .cse6 v_ArrVal_615) .cse4 v_ArrVal_618)) |c_~#stored_elements~0.base| v_ArrVal_619))) (let ((.cse0 (select .cse1 .cse4)) (.cse3 (select .cse5 |c_~#queue~0.base|)) (.cse2 (+ 1600 |c_~#queue~0.offset|))) (or (= .cse0 (select .cse1 .cse2)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse3 .cse4))) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store (store (store (store .cse3 .cse6 v_ArrVal_620) .cse2 v_ArrVal_622) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_624) .cse6 v_ArrVal_626) .cse4 v_ArrVal_628)) |c_~#stored_elements~0.base| v_ArrVal_630) |c_~#queue~0.base|) .cse2) 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| .cse0)) (< (+ (select .cse3 .cse2) 1) v_ArrVal_622) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse7 .cse4))) (< (+ (select .cse8 .cse4) 1) v_ArrVal_618)))))))))) is different from false [2023-05-20 15:38:11,177 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_608 Int) (v_ArrVal_618 Int) (v_ArrVal_606 Int) (v_ArrVal_628 Int) (v_ArrVal_615 Int) (v_ArrVal_626 Int) (v_ArrVal_630 (Array Int Int)) (v_ArrVal_602 Int) (v_ArrVal_613 Int) (v_ArrVal_624 Int) (v_ArrVal_622 Int) (v_ArrVal_612 (Array Int Int)) (v_ArrVal_620 Int) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_619 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int)) (let ((.cse10 (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_602)))) (let ((.cse12 (store (store .cse10 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_604) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_605))) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse0 (select .cse12 |c_~#queue~0.base|))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (let ((.cse13 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_606))) (store (store .cse13 .cse4 v_ArrVal_608) .cse1 (+ (select .cse13 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_612))) (let ((.cse7 (select .cse11 |c_~#queue~0.base|))) (let ((.cse8 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_613))) (let ((.cse2 (store (store .cse11 |c_~#queue~0.base| (store (store .cse8 .cse4 v_ArrVal_615) .cse1 v_ArrVal_618)) |c_~#stored_elements~0.base| v_ArrVal_619))) (let ((.cse6 (select .cse7 .cse1)) (.cse5 (+ 1600 |c_~#queue~0.offset|)) (.cse3 (select .cse2 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse0 .cse1))) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store (store (store .cse3 .cse4 v_ArrVal_620) .cse5 v_ArrVal_622) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_624) .cse4 v_ArrVal_626) .cse1 v_ArrVal_628)) |c_~#stored_elements~0.base| v_ArrVal_630) |c_~#queue~0.base|) .cse5) 400) (= .cse6 (select .cse7 .cse5)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| .cse6)) (< (+ (select .cse8 .cse1) 1) v_ArrVal_618) (< (+ (select .cse3 .cse5) 1) v_ArrVal_622) (let ((.cse9 (select .cse10 |c_~#queue~0.base|))) (< (select .cse9 .cse1) (select .cse9 .cse5))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse3 .cse1))))))))))))) is different from false [2023-05-20 15:38:11,283 INFO L356 Elim1Store]: treesize reduction 96, result has 47.0 percent of original size [2023-05-20 15:38:11,283 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 2809 treesize of output 2146 [2023-05-20 15:38:11,410 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 15:38:11,411 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 3608 treesize of output 3514 [2023-05-20 15:38:11,462 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 1062 treesize of output 998 [2023-05-20 15:38:11,501 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 2545 treesize of output 2473 [2023-05-20 15:38:11,581 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 1831 treesize of output 1767 [2023-05-20 15:38:11,629 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 2355 treesize of output 2275 [2023-05-20 15:38:11,688 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 1377 treesize of output 1341 [2023-05-20 15:38:29,072 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 1002 treesize of output 914 [2023-05-20 15:38:41,653 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 15:38:41,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4700 treesize of output 4054 [2023-05-20 15:38:44,797 INFO L356 Elim1Store]: treesize reduction 5, result has 93.8 percent of original size [2023-05-20 15:38:44,798 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 44 treesize of output 109 [2023-05-20 15:38:45,021 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2023-05-20 15:38:45,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767509441] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 15:38:45,022 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 15:38:45,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 47, 57] total 146 [2023-05-20 15:38:45,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241518122] [2023-05-20 15:38:45,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 15:38:45,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 146 states [2023-05-20 15:38:45,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 15:38:45,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2023-05-20 15:38:45,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1607, Invalid=14572, Unknown=149, NotChecked=4842, Total=21170 [2023-05-20 15:38:45,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:38:45,032 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 15:38:45,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 146 states, 146 states have (on average 5.5) internal successors, (803), 146 states have internal predecessors, (803), 0 states have call successors, (0), 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-20 15:38:45,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:38:45,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:38:45,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2023-05-20 15:38:45,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2023-05-20 15:38:45,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2023-05-20 15:38:45,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:40:45,088 WARN L233 SmtUtils]: Spent 10.18s on a formula simplification. DAG size of input: 82 DAG size of output: 78 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 15:41:10,885 WARN L233 SmtUtils]: Spent 8.20s on a formula simplification. DAG size of input: 112 DAG size of output: 82 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 15:41:51,506 WARN L233 SmtUtils]: Spent 17.30s on a formula simplification. DAG size of input: 132 DAG size of output: 109 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 15:42:22,439 WARN L233 SmtUtils]: Spent 13.88s on a formula simplification. DAG size of input: 150 DAG size of output: 109 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 15:43:02,673 WARN L233 SmtUtils]: Spent 21.14s on a formula simplification. DAG size of input: 143 DAG size of output: 105 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 15:43:51,698 WARN L233 SmtUtils]: Spent 23.10s on a formula simplification. DAG size of input: 125 DAG size of output: 103 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-05-20 15:44:58,958 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-20 15:44:58,958 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-20 15:44:58,958 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-20 15:44:58,958 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-20 15:44:58,958 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-20 15:44:59,605 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-20 15:44:59,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 15:44:59,785 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 203 known predicates. [2023-05-20 15:44:59,785 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-05-20 15:44:59,786 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-05-20 15:44:59,786 INFO L307 ceAbstractionStarter]: Result for error location t2Thread1of1ForFork1 was TIMEOUT (3/3) [2023-05-20 15:44:59,787 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-20 15:44:59,787 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-20 15:44:59,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.05 03:44:59 BasicIcfg [2023-05-20 15:44:59,789 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-20 15:44:59,789 INFO L158 Benchmark]: Toolchain (without parser) took 830317.82ms. Allocated memory was 300.9MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 270.7MB in the beginning and 1.9GB in the end (delta: -1.6GB). Peak memory consumption was 160.1MB. Max. memory is 8.0GB. [2023-05-20 15:44:59,789 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 187.7MB. Free memory is still 142.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-20 15:44:59,789 INFO L158 Benchmark]: CACSL2BoogieTranslator took 450.11ms. Allocated memory is still 300.9MB. Free memory was 270.2MB in the beginning and 249.3MB in the end (delta: 20.9MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-05-20 15:44:59,790 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.47ms. Allocated memory is still 300.9MB. Free memory was 248.8MB in the beginning and 246.1MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-05-20 15:44:59,790 INFO L158 Benchmark]: Boogie Preprocessor took 34.08ms. Allocated memory is still 300.9MB. Free memory was 246.1MB in the beginning and 243.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-20 15:44:59,790 INFO L158 Benchmark]: RCFGBuilder took 547.90ms. Allocated memory is still 300.9MB. Free memory was 243.6MB in the beginning and 220.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-05-20 15:44:59,790 INFO L158 Benchmark]: TraceAbstraction took 829208.95ms. Allocated memory was 300.9MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 219.4MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 110.4MB. Max. memory is 8.0GB. [2023-05-20 15:44:59,792 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 187.7MB. Free memory is still 142.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 450.11ms. Allocated memory is still 300.9MB. Free memory was 270.2MB in the beginning and 249.3MB in the end (delta: 20.9MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 68.47ms. Allocated memory is still 300.9MB. Free memory was 248.8MB in the beginning and 246.1MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.08ms. Allocated memory is still 300.9MB. Free memory was 246.1MB in the beginning and 243.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 547.90ms. Allocated memory is still 300.9MB. Free memory was 243.6MB in the beginning and 220.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 829208.95ms. Allocated memory was 300.9MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 219.4MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 110.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 21851, independent: 21083, independent conditional: 6952, independent unconditional: 14131, dependent: 768, dependent conditional: 698, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21176, independent: 21083, independent conditional: 6952, independent unconditional: 14131, dependent: 93, dependent conditional: 23, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 21176, independent: 21083, independent conditional: 6952, independent unconditional: 14131, dependent: 93, dependent conditional: 23, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21366, independent: 21083, independent conditional: 30, independent unconditional: 21053, dependent: 283, dependent conditional: 160, dependent unconditional: 123, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21366, independent: 21083, independent conditional: 30, independent unconditional: 21053, dependent: 283, dependent conditional: 23, dependent unconditional: 260, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21366, independent: 21083, independent conditional: 30, independent unconditional: 21053, dependent: 283, dependent conditional: 23, dependent unconditional: 260, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11451, independent: 11375, independent conditional: 12, independent unconditional: 11363, dependent: 76, dependent conditional: 6, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11451, independent: 11358, independent conditional: 0, independent unconditional: 11358, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 93, independent: 17, independent conditional: 12, independent unconditional: 5, dependent: 76, dependent conditional: 6, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 93, independent: 17, independent conditional: 12, independent unconditional: 5, dependent: 76, dependent conditional: 6, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 193, independent: 73, independent conditional: 26, independent unconditional: 46, dependent: 120, dependent conditional: 18, dependent unconditional: 103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 21366, independent: 9708, independent conditional: 18, independent unconditional: 9690, dependent: 207, dependent conditional: 17, dependent unconditional: 190, unknown: 11451, unknown conditional: 18, unknown unconditional: 11433] , Statistics on independence cache: Total cache size (in pairs): 11451, Positive cache size: 11375, Positive conditional cache size: 12, Positive unconditional cache size: 11363, Negative cache size: 76, Negative conditional cache size: 6, Negative unconditional cache size: 70, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 137, Maximal queried relation: 5, Independence queries for same thread: 675 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.3s, Number of persistent set computation: 1546, Number of trivial persistent sets: 1186, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14201, independent: 14131, independent conditional: 0, independent unconditional: 14131, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 21851, independent: 21083, independent conditional: 6952, independent unconditional: 14131, dependent: 768, dependent conditional: 698, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21176, independent: 21083, independent conditional: 6952, independent unconditional: 14131, dependent: 93, dependent conditional: 23, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 21176, independent: 21083, independent conditional: 6952, independent unconditional: 14131, dependent: 93, dependent conditional: 23, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21366, independent: 21083, independent conditional: 30, independent unconditional: 21053, dependent: 283, dependent conditional: 160, dependent unconditional: 123, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21366, independent: 21083, independent conditional: 30, independent unconditional: 21053, dependent: 283, dependent conditional: 23, dependent unconditional: 260, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21366, independent: 21083, independent conditional: 30, independent unconditional: 21053, dependent: 283, dependent conditional: 23, dependent unconditional: 260, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11451, independent: 11375, independent conditional: 12, independent unconditional: 11363, dependent: 76, dependent conditional: 6, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11451, independent: 11358, independent conditional: 0, independent unconditional: 11358, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 93, independent: 17, independent conditional: 12, independent unconditional: 5, dependent: 76, dependent conditional: 6, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 93, independent: 17, independent conditional: 12, independent unconditional: 5, dependent: 76, dependent conditional: 6, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 193, independent: 73, independent conditional: 26, independent unconditional: 46, dependent: 120, dependent conditional: 18, dependent unconditional: 103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 21366, independent: 9708, independent conditional: 18, independent unconditional: 9690, dependent: 207, dependent conditional: 17, dependent unconditional: 190, unknown: 11451, unknown conditional: 18, unknown unconditional: 11433] , Statistics on independence cache: Total cache size (in pairs): 11451, Positive cache size: 11375, Positive conditional cache size: 12, Positive unconditional cache size: 11363, Negative cache size: 76, Negative conditional cache size: 6, Negative unconditional cache size: 70, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 137, Maximal queried relation: 5, Independence queries for same thread: 675 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8501, independent: 8254, independent conditional: 120, independent unconditional: 8134, dependent: 247, dependent conditional: 176, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8345, independent: 8254, independent conditional: 120, independent unconditional: 8134, dependent: 91, dependent conditional: 20, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8345, independent: 8254, independent conditional: 120, independent unconditional: 8134, dependent: 91, dependent conditional: 20, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8365, independent: 8254, independent conditional: 0, independent unconditional: 8254, dependent: 111, dependent conditional: 20, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8365, independent: 8254, independent conditional: 0, independent unconditional: 8254, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8365, independent: 8254, independent conditional: 0, independent unconditional: 8254, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8067, independent: 7996, independent conditional: 0, independent unconditional: 7996, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8067, independent: 7992, independent conditional: 0, independent unconditional: 7992, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 75, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 75, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 131, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8365, independent: 258, independent conditional: 0, independent unconditional: 258, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 8067, unknown conditional: 0, unknown unconditional: 8067] , Statistics on independence cache: Total cache size (in pairs): 8067, Positive cache size: 7996, Positive conditional cache size: 0, Positive unconditional cache size: 7996, Negative cache size: 71, Negative conditional cache size: 0, Negative unconditional cache size: 71, 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: 156 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 200, Number of trivial persistent sets: 172, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8205, independent: 8134, independent conditional: 0, independent unconditional: 8134, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8501, independent: 8254, independent conditional: 120, independent unconditional: 8134, dependent: 247, dependent conditional: 176, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8345, independent: 8254, independent conditional: 120, independent unconditional: 8134, dependent: 91, dependent conditional: 20, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8345, independent: 8254, independent conditional: 120, independent unconditional: 8134, dependent: 91, dependent conditional: 20, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8365, independent: 8254, independent conditional: 0, independent unconditional: 8254, dependent: 111, dependent conditional: 20, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8365, independent: 8254, independent conditional: 0, independent unconditional: 8254, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8365, independent: 8254, independent conditional: 0, independent unconditional: 8254, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8067, independent: 7996, independent conditional: 0, independent unconditional: 7996, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8067, independent: 7992, independent conditional: 0, independent unconditional: 7992, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 75, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 75, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 131, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8365, independent: 258, independent conditional: 0, independent unconditional: 258, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 8067, unknown conditional: 0, unknown unconditional: 8067] , Statistics on independence cache: Total cache size (in pairs): 8067, Positive cache size: 7996, Positive conditional cache size: 0, Positive unconditional cache size: 7996, Negative cache size: 71, Negative conditional cache size: 0, Negative unconditional cache size: 71, 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: 156 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 13208, independent: 12146, independent conditional: 2098, independent unconditional: 10048, dependent: 1062, dependent conditional: 1015, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12193, independent: 12146, independent conditional: 2098, independent unconditional: 10048, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12193, independent: 12146, independent conditional: 2098, independent unconditional: 10048, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12193, independent: 12146, independent conditional: 0, independent unconditional: 12146, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12193, independent: 12146, independent conditional: 0, independent unconditional: 12146, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12193, independent: 12146, independent conditional: 0, independent unconditional: 12146, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9715, independent: 9668, independent conditional: 0, independent unconditional: 9668, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9715, independent: 9662, independent conditional: 0, independent unconditional: 9662, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 53, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 53, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 102, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 12193, independent: 2478, independent conditional: 0, independent unconditional: 2478, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9715, unknown conditional: 0, unknown unconditional: 9715] , Statistics on independence cache: Total cache size (in pairs): 9715, Positive cache size: 9668, Positive conditional cache size: 0, Positive unconditional cache size: 9668, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 1015 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 221, Number of trivial persistent sets: 180, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10095, independent: 10048, independent conditional: 0, independent unconditional: 10048, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 13208, independent: 12146, independent conditional: 2098, independent unconditional: 10048, dependent: 1062, dependent conditional: 1015, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12193, independent: 12146, independent conditional: 2098, independent unconditional: 10048, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12193, independent: 12146, independent conditional: 2098, independent unconditional: 10048, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12193, independent: 12146, independent conditional: 0, independent unconditional: 12146, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12193, independent: 12146, independent conditional: 0, independent unconditional: 12146, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12193, independent: 12146, independent conditional: 0, independent unconditional: 12146, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9715, independent: 9668, independent conditional: 0, independent unconditional: 9668, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9715, independent: 9662, independent conditional: 0, independent unconditional: 9662, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 53, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 53, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 102, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 12193, independent: 2478, independent conditional: 0, independent unconditional: 2478, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9715, unknown conditional: 0, unknown unconditional: 9715] , Statistics on independence cache: Total cache size (in pairs): 9715, Positive cache size: 9668, Positive conditional cache size: 0, Positive unconditional cache size: 9668, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 1015 - 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 PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 203 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: 8.7s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 3.9s, 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: 59, 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, 4.3s InterpolantComputationTime, 933 NumberOfCodeBlocks, 933 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 926 ConstructedInterpolants, 0 QuantifiedInterpolants, 4759 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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: 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, 59 NumberOfCodeBlocks, 59 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 58 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: 820.0s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 463.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: 220, 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 355.8s InterpolantComputationTime, 1613 NumberOfCodeBlocks, 1613 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1892 ConstructedInterpolants, 220 QuantifiedInterpolants, 207391 SizeOfPredicates, 53 NumberOfNonLiveVariables, 639 ConjunctsInSsa, 137 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 89/278 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