/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/NewStatesSleep-VarAbsGlobalSyntactic.epf -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -i ../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/queue_ok_longer.line295.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-09-30 06:17:13,830 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-30 06:17:13,832 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-30 06:17:13,864 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-30 06:17:13,864 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-30 06:17:13,867 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-30 06:17:13,870 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-30 06:17:13,876 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-30 06:17:13,878 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-30 06:17:13,883 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-30 06:17:13,884 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-30 06:17:13,885 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-30 06:17:13,886 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-30 06:17:13,888 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-30 06:17:13,890 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-30 06:17:13,893 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-30 06:17:13,894 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-30 06:17:13,895 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-30 06:17:13,897 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-30 06:17:13,903 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-30 06:17:13,904 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-30 06:17:13,905 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-30 06:17:13,907 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-30 06:17:13,908 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-30 06:17:13,915 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-30 06:17:13,916 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-30 06:17:13,916 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-30 06:17:13,918 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-30 06:17:13,919 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-30 06:17:13,919 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-30 06:17:13,920 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-30 06:17:13,921 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-30 06:17:13,922 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-30 06:17:13,923 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-30 06:17:13,924 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-30 06:17:13,924 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-30 06:17:13,925 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-30 06:17:13,925 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-30 06:17:13,925 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-30 06:17:13,926 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-30 06:17:13,926 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-30 06:17:13,928 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-09-30 06:17:13,966 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-30 06:17:13,967 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-30 06:17:13,967 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-09-30 06:17:13,967 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-09-30 06:17:13,968 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-30 06:17:13,968 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-30 06:17:13,969 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-30 06:17:13,969 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-30 06:17:13,969 INFO L138 SettingsManager]: * Use SBE=true [2022-09-30 06:17:13,969 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-30 06:17:13,969 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-30 06:17:13,970 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-30 06:17:13,970 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-30 06:17:13,970 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-30 06:17:13,970 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-30 06:17:13,970 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-30 06:17:13,970 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-30 06:17:13,971 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-30 06:17:13,971 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-30 06:17:13,971 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-30 06:17:13,971 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-30 06:17:13,971 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-30 06:17:13,971 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-30 06:17:13,971 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-30 06:17:13,972 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-30 06:17:13,972 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-30 06:17:13,972 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-30 06:17:13,972 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-30 06:17:13,972 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-30 06:17:13,973 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-30 06:17:13,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-30 06:17:13,973 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-30 06:17:13,973 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-09-30 06:17:13,973 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-09-30 06:17:13,973 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-09-30 06:17:13,973 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-09-30 06:17:13,974 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-09-30 06:17:13,974 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-09-30 06:17:13,974 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-09-30 06:17:14,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-30 06:17:14,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-30 06:17:14,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-30 06:17:14,242 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-09-30 06:17:14,245 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-09-30 06:17:14,246 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/queue_ok_longer.line295.bpl [2022-09-30 06:17:14,247 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/queue_ok_longer.line295.bpl' [2022-09-30 06:17:14,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-30 06:17:14,322 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-09-30 06:17:14,323 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-30 06:17:14,324 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-30 06:17:14,324 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-30 06:17:14,339 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "queue_ok_longer.line295.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:17:14" (1/1) ... [2022-09-30 06:17:14,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "queue_ok_longer.line295.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:17:14" (1/1) ... [2022-09-30 06:17:14,379 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "queue_ok_longer.line295.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:17:14" (1/1) ... [2022-09-30 06:17:14,380 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "queue_ok_longer.line295.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:17:14" (1/1) ... [2022-09-30 06:17:14,400 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "queue_ok_longer.line295.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:17:14" (1/1) ... [2022-09-30 06:17:14,405 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "queue_ok_longer.line295.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:17:14" (1/1) ... [2022-09-30 06:17:14,409 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "queue_ok_longer.line295.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:17:14" (1/1) ... [2022-09-30 06:17:14,415 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-30 06:17:14,417 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-30 06:17:14,417 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-30 06:17:14,417 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-30 06:17:14,434 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue_ok_longer.line295.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:17:14" (1/1) ... [2022-09-30 06:17:14,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-30 06:17:14,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:17:14,462 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-09-30 06:17:14,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-09-30 06:17:14,504 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-09-30 06:17:14,504 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-09-30 06:17:14,504 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-09-30 06:17:14,504 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-09-30 06:17:14,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-30 06:17:14,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-30 06:17:14,506 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-30 06:17:14,663 INFO L234 CfgBuilder]: Building ICFG [2022-09-30 06:17:14,664 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-30 06:17:15,281 INFO L275 CfgBuilder]: Performing block encoding [2022-09-30 06:17:15,306 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-30 06:17:15,306 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-09-30 06:17:15,310 INFO L202 PluginConnector]: Adding new model queue_ok_longer.line295.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 06:17:15 BoogieIcfgContainer [2022-09-30 06:17:15,310 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-30 06:17:15,316 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-30 06:17:15,317 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-30 06:17:15,321 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-30 06:17:15,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue_ok_longer.line295.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 06:17:14" (1/2) ... [2022-09-30 06:17:15,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ad860e1 and model type queue_ok_longer.line295.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 06:17:15, skipping insertion in model container [2022-09-30 06:17:15,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "queue_ok_longer.line295.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 06:17:15" (2/2) ... [2022-09-30 06:17:15,328 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.line295.bpl [2022-09-30 06:17:15,339 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-09-30 06:17:15,348 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-30 06:17:15,349 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-09-30 06:17:15,350 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-30 06:17:15,540 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-09-30 06:17:15,631 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-30 06:17:15,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-30 06:17:15,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:17:15,635 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-09-30 06:17:15,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-09-30 06:17:15,690 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-30 06:17:15,699 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-09-30 06:17:15,705 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;@18f6d8c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-30 06:17:15,706 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-30 06:17:15,794 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-09-30 06:17:15,798 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-09-30 06:17:15,800 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (1/4) [2022-09-30 06:17:15,810 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-30 06:17:15,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-30 06:17:15,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:17:15,813 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-09-30 06:17:15,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2022-09-30 06:17:15,818 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-30 06:17:15,819 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-09-30 06:17:15,820 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;@18f6d8c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-30 06:17:15,820 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-30 06:17:16,190 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-09-30 06:17:16,193 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-09-30 06:17:16,197 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/4) [2022-09-30 06:17:16,205 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-30 06:17:16,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-30 06:17:16,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:17:16,237 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-09-30 06:17:16,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2022-09-30 06:17:16,243 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-30 06:17:16,244 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err0ASSERT_VIOLATIONASSERT ======== [2022-09-30 06:17:16,244 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;@18f6d8c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-30 06:17:16,245 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-30 06:17:16,245 WARN L124 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-09-30 06:17:16,245 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-09-30 06:17:16,246 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-09-30 06:17:16,246 INFO L307 ceAbstractionStarter]: Result for error location t1Err0ASSERT_VIOLATIONASSERT was SAFE (3/4) [2022-09-30 06:17:16,252 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-30 06:17:16,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-30 06:17:16,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:17:16,256 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-09-30 06:17:16,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2022-09-30 06:17:16,264 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-30 06:17:16,264 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Err0ASSERT_VIOLATIONASSERT ======== [2022-09-30 06:17:16,265 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;@18f6d8c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-30 06:17:16,265 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-30 06:17:16,362 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:17:16,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:17:16,368 INFO L85 PathProgramCache]: Analyzing trace with hash -944447742, now seen corresponding path program 1 times [2022-09-30 06:17:16,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:17:16,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197293557] [2022-09-30 06:17:16,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:17:16,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:17:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:17:16,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:17:16,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:17:16,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197293557] [2022-09-30 06:17:16,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197293557] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-30 06:17:16,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-30 06:17:16,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-30 06:17:16,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897660529] [2022-09-30 06:17:16,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-30 06:17:16,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-09-30 06:17:16,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 06:17:16,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-09-30 06:17:16,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-09-30 06:17:16,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:17:16,830 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 06:17:16,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 109.0) internal successors, (218), 2 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-30 06:17:16,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:17:16,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:17:16,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-30 06:17:16,851 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:17:16,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:17:16,852 INFO L85 PathProgramCache]: Analyzing trace with hash -484467378, now seen corresponding path program 1 times [2022-09-30 06:17:16,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:17:16,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732204992] [2022-09-30 06:17:16,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:17:16,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:17:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:17:23,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:17:23,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:17:23,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732204992] [2022-09-30 06:17:23,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732204992] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-30 06:17:23,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-30 06:17:23,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-09-30 06:17:23,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094297455] [2022-09-30 06:17:23,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-30 06:17:23,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-09-30 06:17:23,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 06:17:23,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-09-30 06:17:23,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1003, Unknown=0, NotChecked=0, Total=1122 [2022-09-30 06:17:23,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:17:23,613 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 06:17:23,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 6.545454545454546) internal successors, (216), 34 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-30 06:17:23,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:17:23,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:17:41,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:17:41,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-09-30 06:17:41,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-30 06:17:41,788 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:17:41,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:17:41,788 INFO L85 PathProgramCache]: Analyzing trace with hash 981294747, now seen corresponding path program 1 times [2022-09-30 06:17:41,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:17:41,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794731719] [2022-09-30 06:17:41,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:17:41,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:17:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:17:42,605 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:17:42,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:17:42,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794731719] [2022-09-30 06:17:42,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794731719] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-30 06:17:42,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481692322] [2022-09-30 06:17:42,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:17:42,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 06:17:42,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:17:42,613 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-30 06:17:42,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-09-30 06:17:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:17:42,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 95 conjunts are in the unsatisfiable core [2022-09-30 06:17:42,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-30 06:17:43,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-09-30 06:17:43,282 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-30 06:17:43,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-09-30 06:17:43,831 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 [2022-09-30 06:17:44,086 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-30 06:17:44,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 18 [2022-09-30 06:17:44,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:17:44,168 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 21 treesize of output 20 [2022-09-30 06:17:44,704 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 [2022-09-30 06:17:45,315 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-09-30 06:17:45,316 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-09-30 06:17:45,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:17:45,552 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 21 treesize of output 20 [2022-09-30 06:17:45,627 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 [2022-09-30 06:17:45,695 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:17:45,695 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-30 06:17:45,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481692322] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-30 06:17:45,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-30 06:17:45,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [23] total 57 [2022-09-30 06:17:45,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752541435] [2022-09-30 06:17:45,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-30 06:17:45,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-09-30 06:17:45,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 06:17:45,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-09-30 06:17:45,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=3001, Unknown=0, NotChecked=0, Total=3192 [2022-09-30 06:17:45,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:17:45,700 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 06:17:45,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 8.485714285714286) internal successors, (297), 35 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-30 06:17:45,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:17:45,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-09-30 06:17:45,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:17:49,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:17:49,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-09-30 06:17:49,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-09-30 06:17:49,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-09-30 06:17:50,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 06:17:50,000 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:17:50,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:17:50,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1444466288, now seen corresponding path program 1 times [2022-09-30 06:17:50,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:17:50,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104524188] [2022-09-30 06:17:50,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:17:50,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:17:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:17:51,874 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:17:51,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:17:51,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104524188] [2022-09-30 06:17:51,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104524188] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-30 06:17:51,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125936353] [2022-09-30 06:17:51,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:17:51,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 06:17:51,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:17:51,876 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-30 06:17:51,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-09-30 06:17:52,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:17:52,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 125 conjunts are in the unsatisfiable core [2022-09-30 06:17:52,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-30 06:17:52,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-09-30 06:17:52,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-09-30 06:17:52,527 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-30 06:17:52,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-09-30 06:17:52,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-09-30 06:17:53,087 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 [2022-09-30 06:17:53,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:17:53,379 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 21 treesize of output 20 [2022-09-30 06:17:53,950 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-30 06:17:53,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-09-30 06:17:53,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-09-30 06:17:55,396 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:17:55,407 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-09-30 06:17:55,408 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 45 [2022-09-30 06:17:56,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:17:56,165 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 21 treesize of output 20 [2022-09-30 06:17:56,561 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:17:56,561 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-09-30 06:17:57,017 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 [2022-09-30 06:17:57,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:17:57,393 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 [2022-09-30 06:17:57,872 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-09-30 06:17:58,113 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:17:58,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-30 06:17:58,627 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_166 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_166) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_166 (Array Int Int))) (< (+ 3 (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_166) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|)))) is different from false [2022-09-30 06:17:58,657 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_166 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| v_ArrVal_166) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|))))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| Int)) (or (forall ((v_ArrVal_166 (Array Int Int))) (< (+ (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| v_ArrVal_166) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 4) 3 |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| |c_~#stored_elements~0.base|))))) is different from false [2022-09-30 06:17:58,683 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_166 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| v_ArrVal_166) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|))))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| Int)) (or (forall ((v_ArrVal_166 (Array Int Int))) (< (+ (* (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| v_ArrVal_166) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 4) 3 |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| |c_~#stored_elements~0.base|))))) is different from false [2022-09-30 06:17:58,782 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:17:58,783 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-09-30 06:17:58,792 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:17:58,792 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 42 treesize of output 45 [2022-09-30 06:17:58,797 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 15 treesize of output 11 [2022-09-30 06:17:58,814 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:17:58,815 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-09-30 06:17:58,822 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:17:58,825 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2022-09-30 06:18:00,369 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| Int)) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|)) (forall ((v_ArrVal_162 Int)) (<= 0 (+ (* (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| v_ArrVal_162) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 4) |c_~#queue~0.offset| 4))))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| Int)) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|)) (forall ((v_ArrVal_162 Int)) (< (+ 7 (* (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| v_ArrVal_162) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 4) |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2022-09-30 06:18:01,046 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| Int)) (or (forall ((v_ArrVal_162 Int)) (<= 0 (+ |c_~#queue~0.offset| 4 (* (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| v_ArrVal_162) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 4)))) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|)))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| Int)) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|)) (forall ((v_ArrVal_162 Int)) (< (+ 7 |c_~#queue~0.offset| (* (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| v_ArrVal_162) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 4)) (select |c_#length| |c_~#queue~0.base|))))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|))) is different from false [2022-09-30 06:18:07,722 WARN L233 SmtUtils]: Spent 6.42s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:18:14,526 WARN L233 SmtUtils]: Spent 6.66s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:18:27,142 WARN L233 SmtUtils]: Spent 11.83s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:18:46,757 WARN L233 SmtUtils]: Spent 15.77s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:19:07,367 WARN L233 SmtUtils]: Spent 16.36s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:19:23,356 WARN L233 SmtUtils]: Spent 12.40s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:19:43,439 WARN L233 SmtUtils]: Spent 15.59s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:20:17,868 WARN L233 SmtUtils]: Spent 20.33s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:20:37,400 WARN L233 SmtUtils]: Spent 19.26s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:20:47,812 WARN L233 SmtUtils]: Spent 10.14s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:20:54,140 WARN L233 SmtUtils]: Spent 5.46s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:21:10,062 WARN L233 SmtUtils]: Spent 9.95s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:21:23,073 WARN L233 SmtUtils]: Spent 9.80s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:21:38,016 WARN L233 SmtUtils]: Spent 6.11s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:21:38,112 INFO L356 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2022-09-30 06:21:38,112 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 66 [2022-09-30 06:21:38,128 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:21:38,129 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 99 treesize of output 101 [2022-09-30 06:21:38,139 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:21:38,143 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 54 treesize of output 46 [2022-09-30 06:21:38,188 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 6 treesize of output 4 [2022-09-30 06:21:38,194 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:21:38,204 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:21:38,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 77 [2022-09-30 06:21:38,497 INFO L356 Elim1Store]: treesize reduction 41, result has 2.4 percent of original size [2022-09-30 06:21:38,497 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 1 [2022-09-30 06:21:52,812 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 114 treesize of output 110 [2022-09-30 06:21:53,096 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:21:53,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 58 [2022-09-30 06:21:53,403 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:21:53,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125936353] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-30 06:21:53,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-30 06:21:53,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 46, 48] total 134 [2022-09-30 06:21:53,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522686197] [2022-09-30 06:21:53,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-30 06:21:53,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 135 states [2022-09-30 06:21:53,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 06:21:53,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2022-09-30 06:21:53,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=620, Invalid=16118, Unknown=52, NotChecked=1300, Total=18090 [2022-09-30 06:21:53,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:21:53,413 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 06:21:53,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 135 states, 134 states have (on average 5.895522388059701) internal successors, (790), 135 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-30 06:21:53,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:21:53,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-09-30 06:21:53,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-09-30 06:21:53,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:21:59,919 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (let ((.cse4 (< |c_~#stored_elements~0.base| |c_~#queue~0.base|)) (.cse5 (select |c_#length| |c_~#queue~0.base|)) (.cse6 (+ |c_ULTIMATE.start_init_~q#1.offset| 1604)) (.cse9 (= (select .cse7 1604) 0))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_empty_#in~q#1.base|) 1604) 0) (not (= |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (= |c_ULTIMATE.start_read~int_#ptr#1.offset| 1604) (or (and (forall ((v_ArrVal_157 Int) (v_ArrVal_162 Int) (v_ArrVal_160 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_41| Int) (v_ArrVal_159 (Array Int Int))) (let ((.cse0 (select (store (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_157)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_159) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= (+ 1608 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|)) (< (+ 7 (* (select (store (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_41| v_ArrVal_160) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| v_ArrVal_162) .cse1) 4) |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|)) (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_41|)))) (forall ((v_ArrVal_157 Int) (v_ArrVal_162 Int) (v_ArrVal_160 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_41| Int) (v_ArrVal_159 (Array Int Int))) (let ((.cse2 (select (store (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_157)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_159) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (not (<= (+ 1608 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|)) (< (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_41|) (<= 0 (+ (* (select (store (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_41| v_ArrVal_160) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| v_ArrVal_162) .cse3) 4) |c_~#queue~0.offset| 4))))) .cse4) (< .cse5 (+ |c_~#queue~0.offset| 1612))) (<= (select |c_#length| |c_ULTIMATE.start_main_~#id1~0#1.base|) 4) (= (select (select |c_#memory_int| |c_ULTIMATE.start_read~int_#ptr#1.base|) |c_ULTIMATE.start_read~int_#ptr#1.offset|) 0) (= |c_ULTIMATE.start_init_#in~q#1.offset| 0) (= |c_ULTIMATE.start_read~int_#ptr#1.base| |c_~#queue~0.base|) (= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#valid#1| |c_ULTIMATE.start_main_~#id1~0#1.base|) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (select |c_#length| |c_ULTIMATE.start_write~int_#ptr#1.base|) 4) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.offset| 0) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) .cse6) 0) (= |c_ULTIMATE.start_init_~q#1.offset| 0) (= |c_ULTIMATE.start_main_~#id1~0#1.offset| 0) (= (select .cse7 (+ |c_~#queue~0.offset| 1604)) 0) (= |c_ULTIMATE.start_init_~q#1.offset| |c_~#queue~0.offset|) (= |c_ULTIMATE.start_empty_#in~q#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) 1) (= |c_ULTIMATE.start_read~int_#ptr#1.base| |c_ULTIMATE.start_empty_~q#1.base|) (= |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.offset| 0) (= |c_~#queue~0.base| |c_ULTIMATE.start_empty_#in~q#1.base|) (= 7 |c_~#queue~0.base|) (or (and (not (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) (<= 0 (+ |c_~#queue~0.offset| 4)) .cse4) (forall ((v_ArrVal_154 Int) (|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int)) (or (< (select (store |c_#length| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_154) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1612)) (not (= 0 (select |c_#valid| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|)))))) (<= (select |c_#length| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) 4) (<= 1612 .cse5) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (= |c_ULTIMATE.start_empty_~q#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_empty_~q#1.base|) 1604) 0) (<= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#length#1| |c_ULTIMATE.start_main_~#id1~0#1.base|) 4) (= (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_init_~q#1.base|) .cse6) 0) (let ((.cse8 (= |c_~#queue~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|))) (or (and (not .cse8) .cse9) (and .cse8 (not (= |c_ULTIMATE.start_write~int_#ptr#1.offset| 1604)) (= (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) 1604) 0)))) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_#in~q#1.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_ULTIMATE.start_#Ultimate.allocOnStack_~size#1| 4) .cse9))) is different from false [2022-09-30 06:22:04,494 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_~#queue~0.offset| 1604)) (.cse8 (select |c_#length| |c_~#queue~0.base|))) (let ((.cse0 (<= .cse8 4)) (.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse4 (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse7) 0)) (.cse1 (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse7) 0)) (.cse2 (exists ((|ULTIMATE.start_write~int_#ptr#1.base| Int)) (<= (select |c_#length| |ULTIMATE.start_write~int_#ptr#1.base|) 4))) (.cse6 (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (and (or .cse0 (and .cse1 .cse2)) (= |c_t1Thread1of1ForFork1_read~int_#value#1| 0) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| Int)) (or (forall ((v_ArrVal_162 Int)) (<= 0 (+ |c_~#queue~0.offset| 4 (* (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| v_ArrVal_162) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 4)))) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|)))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| Int)) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|)) (forall ((v_ArrVal_162 Int)) (< (+ 7 |c_~#queue~0.offset| (* (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| v_ArrVal_162) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 4)) (select |c_#length| |c_~#queue~0.base|))))) (<= (select |c_#length| |c_ULTIMATE.start_write~int_#ptr#1.base|) 4) (<= 0 |c_~#queue~0.offset|) (<= 0 |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| (+ (* (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse3) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (or .cse0 (and .cse4 .cse2)) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= (select .cse5 1604) |c_t1Thread1of1ForFork1_read~int_#value#1|) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_162 Int)) (<= 0 (+ |c_~#queue~0.offset| 4 (* 4 (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_162)) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)))))) (= (select .cse6 .cse7) 0) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) 1604) 0) (<= (+ |c_t1Thread1of1ForFork1_write~int_#sizeOfWrittenType#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (select |c_#length| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|)) (<= |c_t1Thread1of1ForFork1_read~int_#value#1| (select .cse5 .cse3)) (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) .cse4 .cse1 (= 7 |c_~#queue~0.base|) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) .cse2 (<= 1612 .cse8) (let ((.cse9 (= |c_~#queue~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|))) (or (and (not .cse9) (= (select .cse6 1604) 0)) (and .cse9 (not (= |c_ULTIMATE.start_write~int_#ptr#1.offset| 1604)) (= (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) 1604) 0)))) (<= 4 |c_t1Thread1of1ForFork1_read~int_#sizeOfReadType#1|) (forall ((v_ArrVal_162 Int)) (< (+ 7 |c_~#queue~0.offset| (* 4 (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_162)) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)))) (select |c_#length| |c_~#queue~0.base|))) (<= |c_~#stored_elements~0.base| 6) (<= (+ 1612 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))))) is different from false [2022-09-30 06:22:05,287 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| Int)) (or (forall ((v_ArrVal_162 Int)) (<= 0 (+ |c_~#queue~0.offset| 4 (* (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| v_ArrVal_162) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 4)))) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|)))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| Int)) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|)) (forall ((v_ArrVal_162 Int)) (< (+ 7 |c_~#queue~0.offset| (* (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| v_ArrVal_162) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 4)) (select |c_#length| |c_~#queue~0.base|))))) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 1604) 0) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 0) (= 7 |c_~#queue~0.base|) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (exists ((|ULTIMATE.start_write~int_#ptr#1.base| Int)) (<= (select |c_#length| |ULTIMATE.start_write~int_#ptr#1.base|) 4)) (<= 1612 (select |c_#length| |c_~#queue~0.base|)) (<= |c_~#stored_elements~0.base| 6) (<= (+ 1612 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) is different from false [2022-09-30 06:22:06,070 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 0) (= 7 |c_~#queue~0.base|) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (exists ((|ULTIMATE.start_write~int_#ptr#1.base| Int)) (<= (select |c_#length| |ULTIMATE.start_write~int_#ptr#1.base|) 4)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| Int)) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|)) (forall ((v_ArrVal_162 Int)) (<= 0 (+ (* (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| v_ArrVal_162) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 4) |c_~#queue~0.offset| 4))))) (<= 1612 (select |c_#length| |c_~#queue~0.base|)) (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 1604) 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| Int)) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40|)) (forall ((v_ArrVal_162 Int)) (< (+ 7 (* (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_40| v_ArrVal_162) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 4) |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))))) (<= |c_~#stored_elements~0.base| 6) (<= (+ 1612 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) is different from false [2022-09-30 06:22:06,882 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse1 (select .cse0 1604)) (.cse2 (select |c_#length| |c_~#queue~0.base|))) (and (= (select .cse0 (+ |c_~#queue~0.offset| 1604)) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_166 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| v_ArrVal_166) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|))))) (<= (+ 1608 (* .cse1 4)) .cse2) (= 7 |c_~#queue~0.base|) (exists ((|ULTIMATE.start_write~int_#ptr#1.base| Int)) (<= (select |c_#length| |ULTIMATE.start_write~int_#ptr#1.base|) 4)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| Int)) (or (forall ((v_ArrVal_166 (Array Int Int))) (< (+ (* (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| v_ArrVal_166) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 4) 3 |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| |c_~#stored_elements~0.base|)))) (<= 1 .cse1) (<= (+ |c_~#queue~0.offset| 1612) .cse2) (<= |c_~#stored_elements~0.base| 6)))) is different from false [2022-09-30 06:22:06,895 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|))) (let ((.cse1 (select |c_#length| |c_~#queue~0.base|)) (.cse0 (select .cse2 1604))) (and (<= (+ 1608 (* .cse0 4)) .cse1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 0 |c_~#queue~0.offset|) (= |c_~#queue~0.offset| 0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_166 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| v_ArrVal_166) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|))))) (= (select .cse2 (+ |c_~#queue~0.offset| 1604)) 1) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| Int)) (or (forall ((v_ArrVal_166 (Array Int Int))) (< (+ (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| v_ArrVal_166) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 4) 3 |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_48| |c_~#stored_elements~0.base|)))) (= 7 |c_~#queue~0.base|) (exists ((|ULTIMATE.start_write~int_#ptr#1.base| Int)) (<= (select |c_#length| |ULTIMATE.start_write~int_#ptr#1.base|) 4)) (<= (+ |c_~#queue~0.offset| 1612) .cse1) (<= |c_~#stored_elements~0.base| 6) (<= 1 .cse0)))) is different from false [2022-09-30 06:22:07,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:22:07,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-09-30 06:22:07,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-09-30 06:22:07,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-09-30 06:22:07,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-09-30 06:22:08,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 06:22:08,006 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:22:08,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:22:08,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1770284473, now seen corresponding path program 1 times [2022-09-30 06:22:08,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:22:08,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902640532] [2022-09-30 06:22:08,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:22:08,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:22:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:22:08,761 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 58 proven. 52 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-09-30 06:22:08,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:22:08,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902640532] [2022-09-30 06:22:08,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902640532] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-30 06:22:08,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700935920] [2022-09-30 06:22:08,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:22:08,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 06:22:08,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:22:08,768 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-30 06:22:08,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-09-30 06:22:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:22:08,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 164 conjunts are in the unsatisfiable core [2022-09-30 06:22:08,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-30 06:22:09,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-09-30 06:22:09,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-09-30 06:22:09,373 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-30 06:22:09,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-09-30 06:22:09,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-09-30 06:22:09,823 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 [2022-09-30 06:22:10,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:22:10,040 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 21 treesize of output 20 [2022-09-30 06:22:10,740 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-30 06:22:10,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-09-30 06:22:10,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-09-30 06:22:12,193 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:22:12,204 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-09-30 06:22:12,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 45 [2022-09-30 06:22:12,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:22:12,831 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 32 [2022-09-30 06:22:13,191 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:22:13,192 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-09-30 06:22:13,611 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 [2022-09-30 06:22:13,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:22:13,972 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 28 treesize of output 30 [2022-09-30 06:22:14,859 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:22:14,871 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-09-30 06:22:14,871 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 45 [2022-09-30 06:22:15,112 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-30 06:22:15,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 27 [2022-09-30 06:22:15,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:22:15,398 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 21 treesize of output 20 [2022-09-30 06:22:15,535 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:22:15,536 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-09-30 06:22:15,649 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 60 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:22:15,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-30 06:22:41,266 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:22:41,266 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 42 [2022-09-30 06:22:41,277 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:22:41,277 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 79 treesize of output 81 [2022-09-30 06:22:41,285 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 82 treesize of output 74 [2022-09-30 06:22:41,299 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 6 treesize of output 4 [2022-09-30 06:22:41,344 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:22:41,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 54 [2022-09-30 06:22:57,601 WARN L233 SmtUtils]: Spent 5.32s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:23:21,377 WARN L233 SmtUtils]: Spent 8.61s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:23:36,252 WARN L233 SmtUtils]: Spent 6.49s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:23:51,578 WARN L233 SmtUtils]: Spent 6.64s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:24:12,206 WARN L233 SmtUtils]: Spent 7.58s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:24:23,759 INFO L356 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2022-09-30 06:24:23,759 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 40 [2022-09-30 06:24:23,772 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:24:23,772 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 47 treesize of output 50 [2022-09-30 06:24:23,779 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 22 treesize of output 18 [2022-09-30 06:24:23,871 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-09-30 06:24:23,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 31 [2022-09-30 06:24:23,875 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:24:23,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 10 [2022-09-30 06:24:25,016 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 52 treesize of output 50 [2022-09-30 06:24:25,205 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:24:25,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 58 [2022-09-30 06:24:25,453 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 60 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:24:25,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700935920] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-30 06:24:25,453 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-30 06:24:25,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 54, 53] total 124 [2022-09-30 06:24:25,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771176714] [2022-09-30 06:24:25,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-30 06:24:25,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 124 states [2022-09-30 06:24:25,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-30 06:24:25,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2022-09-30 06:24:25,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=641, Invalid=14488, Unknown=123, NotChecked=0, Total=15252 [2022-09-30 06:24:25,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:24:25,459 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-30 06:24:25,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 124 states, 124 states have (on average 7.911290322580645) internal successors, (981), 124 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-30 06:24:25,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:24:25,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-09-30 06:24:25,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-09-30 06:24:25,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2022-09-30 06:24:25,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:24:30,025 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (< |c_~#stored_elements~0.base| |c_~#queue~0.base|))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse0 (and (not (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) .cse3)) (.cse2 (select |c_#length| |c_~#queue~0.base|))) (and (= |c_ULTIMATE.start_init_~q#1.base| |c_ULTIMATE.start_write~int_#ptr#1.base|) (<= (select |c_#length| |c_ULTIMATE.start_main_~#id1~0#1.base|) 4) (= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#valid#1| |c_ULTIMATE.start_main_~#id1~0#1.base|) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (or .cse0 (forall ((v_ArrVal_237 Int)) (< (select (store |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#length#1| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_237) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1612)))) (= |c_~#queue~0.base| |c_ULTIMATE.start_write~int_#ptr#1.base|) (= |c_~#queue~0.offset| 0) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_ULTIMATE.start_init_~q#1.offset| 0) (= (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse1) 0) (= |c_ULTIMATE.start_init_~q#1.offset| |c_~#queue~0.offset|) (<= (+ 1608 |c_~#queue~0.offset|) |c_ULTIMATE.start_write~int_#ptr#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) 1) (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse1) 0) (= |c_~#queue~0.base| |c_ULTIMATE.start_empty_#in~q#1.base|) (= 7 |c_~#queue~0.base|) (<= 1612 .cse2) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (or .cse0 (forall ((|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_237 Int)) (or (< (select (store |c_#length| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_237) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1612)) (not (= 0 (select |c_#valid| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|)))))) (<= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#length#1| |c_ULTIMATE.start_main_~#id1~0#1.base|) 4) (= (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_init_~q#1.base|) (+ |c_ULTIMATE.start_init_~q#1.offset| 1604)) 0) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= (+ 1612 (select |c_#length| |c_ULTIMATE.start_write~int_#ptr#1.base|)) (+ .cse2 |c_ULTIMATE.start_write~int_#sizeOfWrittenType#1| |c_ULTIMATE.start_write~int_#ptr#1.offset|)) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_#in~q#1.base|) (<= |c_~#stored_elements~0.base| 6) (or (and (forall ((|v_ULTIMATE.start_write~int_#ptr#1.offset_21| Int)) (or (not (<= (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) |v_ULTIMATE.start_write~int_#ptr#1.offset_21|)) (forall ((v_ArrVal_240 Int) (v_ArrVal_242 (Array Int Int))) (not (= 399 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_21| v_ArrVal_240)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_242) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604))))))) .cse3 (forall ((|v_ULTIMATE.start_write~int_#ptr#1.offset_21| Int)) (or (forall ((v_ArrVal_240 Int) (v_ArrVal_242 (Array Int Int))) (< (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) |v_ULTIMATE.start_write~int_#ptr#1.offset_21| v_ArrVal_240)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_242) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 4) 1600)) (not (<= (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) |v_ULTIMATE.start_write~int_#ptr#1.offset_21|))))) (< .cse2 (+ |c_~#queue~0.offset| 1612))) (<= |c_ULTIMATE.start_#Ultimate.allocOnStack_~size#1| 4)))) is different from false [2022-09-30 06:24:33,844 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (< |c_~#stored_elements~0.base| |c_~#queue~0.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse6 (+ |c_~#queue~0.offset| 1604)) (.cse8 (select |c_#length| |c_~#queue~0.base|))) (let ((.cse0 (<= .cse8 4)) (.cse2 (exists ((|ULTIMATE.start_write~int_#ptr#1.base| Int)) (<= (select |c_#length| |ULTIMATE.start_write~int_#ptr#1.base|) 4))) (.cse1 (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse6) 0)) (.cse5 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse4)) (.cse3 (and (not (= |c_~#queue~0.base| |c_ULTIMATE.start_main_~#id1~0#1.base|)) .cse7))) (and (or .cse0 (and .cse1 .cse2)) (<= (select |c_#length| |c_ULTIMATE.start_main_~#id1~0#1.base|) 4) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (or .cse3 (forall ((v_ArrVal_237 Int)) (< (select (store |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#length#1| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_237) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1612)))) (<= (select |c_#length| |c_ULTIMATE.start_write~int_#ptr#1.base|) 4) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse4)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (not (= 400 .cse5)) (or .cse0 (and (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse6) 0) .cse2)) (= |c_t1Thread1of1ForFork1_read~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|) (= (select (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_~#queue~0.base|) .cse6) 0) (not (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|))) (or (and (forall ((v_ArrVal_240 Int) (v_ArrVal_242 (Array Int Int))) (not (= (select (select (store (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_240)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_242) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 399))) .cse7 (forall ((v_ArrVal_240 Int) (v_ArrVal_242 (Array Int Int))) (< (* (select (select (store (store |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base| (store (select |c_ULTIMATE.start_write~int_old_#memory_int#1| |c_ULTIMATE.start_write~int_#ptr#1.base|) |c_ULTIMATE.start_write~int_#ptr#1.offset| v_ArrVal_240)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_242) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 4) 1600))) (< .cse8 (+ |c_~#queue~0.offset| 1612))) (<= |c_t1Thread1of1ForFork1_read~int_#value#1| .cse5) (= |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 0) (not (= 400 |c_t1Thread1of1ForFork1_read~int_#value#1|)) (= .cse4 |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) .cse1 (= 7 |c_~#queue~0.base|) (<= 1612 .cse8) (or .cse3 (forall ((|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_237 Int)) (or (< (select (store |c_#length| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_237) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1612)) (not (= 0 (select |c_#valid| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|)))))) (<= |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1| .cse5) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_46| Int) (v_ArrVal_253 Int)) (or (not (= 400 (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_46| v_ArrVal_253) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)))) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_46|)))) (<= |c_~#stored_elements~0.base| 6) (or .cse3 (forall ((|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_237 Int)) (or (not (= (select |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#valid#1| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|) 0)) (< (select (store |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#length#1| |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_237) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1612)))))))) is different from false [2022-09-30 06:24:34,952 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_~#queue~0.base|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (or (<= .cse0 4) (and (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 0) (exists ((|ULTIMATE.start_write~int_#ptr#1.base| Int)) (<= (select |c_#length| |ULTIMATE.start_write~int_#ptr#1.base|) 4)))) (= |c_~#queue~0.offset| 0) (= 7 |c_~#queue~0.base|) (<= 1612 .cse0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_46| Int) (v_ArrVal_253 Int)) (or (not (= 400 (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_46| v_ArrVal_253) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)))) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_46|)))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-09-30 06:24:39,745 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_~#queue~0.base|) 1604) 1) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (= (select (select |c_#memory_int| |c_~#queue~0.base|) 1604) 1) (= 7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (or (< .cse0 (+ 1612 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_47| Int) (v_ArrVal_251 Int)) (or (not (= 400 (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_47| v_ArrVal_251) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_47| (+ (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)))))) (= 7 |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) (<= 1612 .cse0) (= (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 1) (<= 1612 (select |c_#length| |c_~#queue~0.base|)) (= (select (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| 7) .cse1) 1) (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset|) (= (select (select |c_#memory_int| 7) .cse1) 1) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) 1604) 1))) is different from false [2022-09-30 06:24:40,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-30 06:24:40,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-09-30 06:24:40,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-09-30 06:24:40,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-09-30 06:24:40,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-09-30 06:24:40,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-09-30 06:24:40,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 06:24:40,228 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONASSERT === [t1Err0ASSERT_VIOLATIONASSERT] === [2022-09-30 06:24:40,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-30 06:24:40,229 INFO L85 PathProgramCache]: Analyzing trace with hash 252233874, now seen corresponding path program 2 times [2022-09-30 06:24:40,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-30 06:24:40,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363455280] [2022-09-30 06:24:40,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-30 06:24:40,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-30 06:24:40,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-30 06:24:43,868 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:24:43,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-30 06:24:43,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363455280] [2022-09-30 06:24:43,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363455280] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-30 06:24:43,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814587671] [2022-09-30 06:24:43,869 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-30 06:24:43,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-30 06:24:43,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-30 06:24:43,870 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-30 06:24:43,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-09-30 06:24:44,097 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-30 06:24:44,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-30 06:24:44,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 216 conjunts are in the unsatisfiable core [2022-09-30 06:24:44,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-30 06:24:44,217 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 7 treesize of output 6 [2022-09-30 06:24:44,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-09-30 06:24:44,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-09-30 06:24:44,822 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-30 06:24:44,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-09-30 06:24:44,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-09-30 06:24:45,628 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2022-09-30 06:24:47,529 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-09-30 06:24:48,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2022-09-30 06:25:00,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:25:00,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2022-09-30 06:25:18,210 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2022-09-30 06:25:36,465 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2022-09-30 06:26:39,958 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2022-09-30 06:26:41,850 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 [2022-09-30 06:26:43,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:26:43,560 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 54 treesize of output 56 [2022-09-30 06:27:37,831 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:27:37,848 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-09-30 06:27:37,848 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 65 [2022-09-30 06:27:59,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:27:59,646 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 72 treesize of output 65 [2022-09-30 06:28:10,411 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 70 treesize of output 52 [2022-09-30 06:28:16,528 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 [2022-09-30 06:28:18,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-30 06:28:18,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 67 [2022-09-30 06:28:19,598 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 70 treesize of output 52 [2022-09-30 06:28:20,415 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 90 refuted. 46 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-30 06:28:20,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-30 06:28:21,330 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_347 (Array Int Int))) (< (+ 3 |c_~#queue~0.offset| (* 4 (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_347) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)))) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_347 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| v_ArrVal_347) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-09-30 06:28:21,354 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_347 (Array Int Int))) (< (+ (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| v_ArrVal_347) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 4) 3 |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_347 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| v_ArrVal_347) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|)))))) is different from false [2022-09-30 06:28:21,383 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| Int)) (or (forall ((v_ArrVal_347 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| v_ArrVal_347) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| |c_~#stored_elements~0.base|)))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| Int)) (or (forall ((v_ArrVal_347 (Array Int Int))) (< (+ (* (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| v_ArrVal_347) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 4) 3 |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_64| |c_~#stored_elements~0.base|))))) is different from false [2022-09-30 06:28:21,495 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:28:21,495 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-09-30 06:28:21,504 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:28:21,504 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 48 treesize of output 51 [2022-09-30 06:28:21,509 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 18 treesize of output 14 [2022-09-30 06:28:21,532 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:28:21,532 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-09-30 06:28:21,535 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-30 06:28:21,537 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 12 [2022-09-30 06:28:26,516 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| Int)) (or (forall ((v_ArrVal_344 Int)) (< (+ 7 (* 4 (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| v_ArrVal_344) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57|)))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| Int)) (or (forall ((v_ArrVal_344 Int)) (<= 0 (+ (* 4 (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| v_ArrVal_344) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) |c_~#queue~0.offset| 4))) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57|))))) is different from false [2022-09-30 06:28:27,433 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| Int)) (or (forall ((v_ArrVal_344 Int)) (<= 0 (+ (* (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| v_ArrVal_344) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 4) |c_~#queue~0.offset| 4))) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57|)))) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| Int)) (or (forall ((v_ArrVal_344 Int)) (< (+ 7 (* (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| v_ArrVal_344) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 4) |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57|))))) is different from false [2022-09-30 06:28:29,344 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| Int) (v_ArrVal_342 Int)) (or (forall ((v_ArrVal_344 Int)) (< (+ 7 (* (select (store (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_342)) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| v_ArrVal_344) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 4) |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|))) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57|)))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| Int) (v_ArrVal_342 Int)) (or (forall ((v_ArrVal_344 Int)) (<= 0 (+ (* (select (store (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_342)) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| v_ArrVal_344) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 4) |c_~#queue~0.offset| 4))) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57|)))) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|))) is different from false [2022-09-30 06:28:37,796 WARN L233 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:29:06,211 WARN L233 SmtUtils]: Spent 28.05s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:29:28,189 WARN L233 SmtUtils]: Spent 19.65s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:29:46,273 WARN L233 SmtUtils]: Spent 17.77s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:30:05,579 WARN L233 SmtUtils]: Spent 19.01s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:30:28,107 WARN L233 SmtUtils]: Spent 22.10s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:30:46,946 WARN L233 SmtUtils]: Spent 18.48s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:30:55,144 WARN L233 SmtUtils]: Spent 7.87s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-30 06:30:56,266 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| Int)) (or (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_58| Int) (v_ArrVal_344 Int) (v_ArrVal_342 Int) (v_ArrVal_340 (Array Int Int))) (let ((.cse0 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| v_ArrVal_340) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_58|) (< (+ (* (select (store (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_58| v_ArrVal_342) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| v_ArrVal_344) .cse1) 4) 7 |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|)) (not (<= 0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_58|)) (not (<= (+ 1608 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57|))))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| |c_~#stored_elements~0.base|)))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| Int)) (or (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_58| Int) (v_ArrVal_344 Int) (v_ArrVal_342 Int) (v_ArrVal_340 (Array Int Int))) (let ((.cse2 (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| v_ArrVal_340) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (<= 0 (+ (* (select (store (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_58| v_ArrVal_342) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| v_ArrVal_344) .cse3) 4) |c_~#queue~0.offset| 4)) (< (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_58|) (not (<= 0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_58|)) (not (<= (+ 1608 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57|))))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| |c_~#stored_elements~0.base|)))) (or (forall ((v_ArrVal_340 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| Int)) (or (< (+ (* (select (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| v_ArrVal_340) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) 0) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| |c_~#stored_elements~0.base|)))) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)))) is different from false [2022-09-30 06:30:56,344 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_340 (Array Int Int)) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| Int)) (or (< (+ (* (select (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| v_ArrVal_340) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) 0) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| |c_~#stored_elements~0.base|)))) (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| Int)) (or (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_58| Int) (v_ArrVal_344 Int) (v_ArrVal_342 Int) (v_ArrVal_340 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| v_ArrVal_340) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_58|) (not (<= 0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_58|)) (not (<= (+ 1608 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57|)) (<= 0 (+ (* (select (store (store .cse0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_58| v_ArrVal_342) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| v_ArrVal_344) .cse1) 4) |c_~#queue~0.offset| 4))))))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| Int)) (or (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_58| Int) (v_ArrVal_344 Int) (v_ArrVal_342 Int) (v_ArrVal_340 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| v_ArrVal_340) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (< (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_58|) (< (+ 7 (* (select (store (store .cse2 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_58| v_ArrVal_342) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57| v_ArrVal_344) .cse3) 4) |c_~#queue~0.offset|) (select |c_#length| |c_~#queue~0.base|)) (not (<= 0 |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_58|)) (not (<= (+ 1608 |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_57|))))) (not (<= |v_t1Thread1of1ForFork1_write~int_#ptr#1.base_68| |c_~#stored_elements~0.base|))))) is different from false [2022-09-30 06:30:56,746 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:30:56,746 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 145 [2022-09-30 06:30:56,757 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:30:56,757 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 246 treesize of output 242 [2022-09-30 06:30:56,763 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 393 treesize of output 381 [2022-09-30 06:30:56,771 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 533 treesize of output 521 [2022-09-30 06:30:56,779 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 521 treesize of output 517 [2022-09-30 06:30:56,798 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 6 treesize of output 4 [2022-09-30 06:30:56,896 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-30 06:30:56,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 222 treesize of output 214 [2022-09-30 06:31:00,140 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int) (v_ArrVal_337 Int)) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)) (= 400 (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))))))) (and (or (not (<= 0 (+ |c_~#queue~0.offset| 1604))) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int) (v_ArrVal_337 Int)) (let ((.cse0 (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)))) (or (< .cse0 400) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)) (= 400 .cse0))))) (or (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) .cse1) (or (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) .cse1) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int)) (or (forall ((v_ArrVal_337 Int)) (let ((.cse3 (select (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)))) (let ((.cse2 (* .cse3 4))) (or (< (+ |c_~#queue~0.offset| 4 .cse2) 0) (< (+ |c_~#queue~0.offset| .cse2 11) (select |c_#length| |c_~#queue~0.base|)) (= 400 .cse3))))) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)))) (or (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse1))) is different from false [2022-09-30 06:31:00,953 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int) (v_ArrVal_337 Int)) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)) (= (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 400))))) (and (or (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) .cse0) (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int)) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)) (forall ((v_ArrVal_337 Int)) (let ((.cse2 (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)))) (let ((.cse1 (* .cse2 4))) (or (< (+ .cse1 |c_~#queue~0.offset| 4) 0) (= .cse2 400) (< (+ .cse1 |c_~#queue~0.offset| 11) (select |c_#length| |c_~#queue~0.base|)))))))) (or (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0) (or (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) .cse0) (or (forall ((|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int) (v_ArrVal_337 Int)) (let ((.cse3 (select (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)))) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)) (= .cse3 400) (< .cse3 400)))) (not (<= 0 (+ |c_~#queue~0.offset| 1604)))))) is different from false [2022-09-30 06:31:02,463 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_335 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int) (v_ArrVal_337 Int)) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)) (= 400 (select (store (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_335)) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))))))) (and (or .cse0 (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|))) (forall ((v_ArrVal_335 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int)) (or (forall ((v_ArrVal_337 Int)) (let ((.cse2 (select (store (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_335)) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)))) (let ((.cse1 (* .cse2 4))) (or (< (+ |c_~#queue~0.offset| .cse1 11) (select |c_#length| |c_~#queue~0.base|)) (= 400 .cse2) (< (+ |c_~#queue~0.offset| .cse1 4) 0))))) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)))) (or (not (<= 0 (+ |c_~#queue~0.offset| 1604))) (forall ((v_ArrVal_335 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int) (v_ArrVal_337 Int)) (let ((.cse3 (select (store (select (store |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base| (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_write~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_write~int_#ptr#1.offset| v_ArrVal_335)) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)))) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)) (= 400 .cse3) (< .cse3 400))))) (or (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0) (or (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) .cse0))) is different from false [2022-09-30 06:31:03,351 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_335 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int) (v_ArrVal_337 Int)) (or (= 400 (select (store (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_335) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)))))) (and (or (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) .cse0) (or (not (<= 0 (+ |c_~#queue~0.offset| 1604))) (forall ((v_ArrVal_335 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int) (v_ArrVal_337 Int)) (let ((.cse1 (select (store (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_335) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)))) (or (= 400 .cse1) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)) (< .cse1 400))))) (or (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0) (forall ((v_ArrVal_335 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int)) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)) (forall ((v_ArrVal_337 Int)) (let ((.cse2 (select (store (store (select |c_t1Thread1of1ForFork1_write~int_old_#memory_int#1| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_335) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)))) (let ((.cse3 (* .cse2 4))) (or (= 400 .cse2) (< (+ |c_~#queue~0.offset| .cse3 11) (select |c_#length| |c_~#queue~0.base|)) (< (+ |c_~#queue~0.offset| .cse3 4) 0))))))) (or .cse0 (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|))))) is different from false [2022-09-30 06:31:04,319 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (forall ((v_ArrVal_335 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int) (v_ArrVal_337 Int)) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)) (= (select (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_335) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 400))))) (and (or (not (<= 0 (+ |c_~#queue~0.offset| 1604))) (forall ((v_ArrVal_335 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int) (v_ArrVal_337 Int)) (let ((.cse0 (select (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_335) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)))) (or (< .cse0 400) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)) (= .cse0 400))))) (or (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse1) (or (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) .cse1) (forall ((v_ArrVal_335 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int)) (or (forall ((v_ArrVal_337 Int)) (let ((.cse3 (select (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_335) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)))) (let ((.cse2 (* .cse3 4))) (or (< (+ |c_~#queue~0.offset| .cse2 11) (select |c_#length| |c_~#queue~0.base|)) (< (+ |c_~#queue~0.offset| 4 .cse2) 0) (= .cse3 400))))) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)))) (or (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) .cse1))) is different from false [2022-09-30 06:31:05,229 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (forall ((v_ArrVal_335 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int) (v_ArrVal_337 Int)) (or (= 400 (select (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_335) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)))))) (and (or (not (<= 0 (+ |c_~#queue~0.offset| 1604))) (forall ((v_ArrVal_335 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int) (v_ArrVal_337 Int)) (let ((.cse0 (select (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_335) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)))) (or (< .cse0 400) (= 400 .cse0) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)))))) (or .cse1 (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|))) (or (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) .cse1) (forall ((v_ArrVal_335 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int)) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)) (forall ((v_ArrVal_337 Int)) (let ((.cse2 (select (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_read~int_#value#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_335) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)))) (let ((.cse3 (* .cse2 4))) (or (= 400 .cse2) (< (+ .cse3 |c_~#queue~0.offset| 4) 0) (< (+ .cse3 |c_~#queue~0.offset| 11) (select |c_#length| |c_~#queue~0.base|)))))))) (or (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse1))) is different from false [2022-09-30 06:31:06,027 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_335 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int) (v_ArrVal_337 Int)) (or (= 400 (select (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_335) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)))))) (and (or .cse0 (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (or (not (<= 0 (+ |c_~#queue~0.offset| 1604))) (forall ((v_ArrVal_335 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int) (v_ArrVal_337 Int)) (let ((.cse1 (select (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_335) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)))) (or (= 400 .cse1) (< .cse1 400) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)))))) (forall ((v_ArrVal_335 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int)) (or (forall ((v_ArrVal_337 Int)) (let ((.cse2 (select (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_read~int_#ptr#1.base|) |c_t1Thread1of1ForFork1_read~int_#ptr#1.offset|) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_335) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)))) (let ((.cse3 (* .cse2 4))) (or (= 400 .cse2) (< (+ |c_~#queue~0.offset| .cse3 11) (select |c_#length| |c_~#queue~0.base|)) (< (+ |c_~#queue~0.offset| .cse3 4) 0))))) (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)))) (or .cse0 (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (or .cse0 (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|))))) is different from false [2022-09-30 06:31:06,888 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_335 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int) (v_ArrVal_337 Int)) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)) (= 400 (let ((.cse9 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (select (store (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse8 (+ (* (select .cse8 .cse9) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_335)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) .cse9))))))) (and (or .cse0 (not (<= |c_~#queue~0.base| |c_~#stored_elements~0.base|))) (or .cse0 (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (or (not (<= 0 (+ |c_~#queue~0.offset| 1604))) (forall ((v_ArrVal_335 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int) (v_ArrVal_337 Int)) (let ((.cse1 (let ((.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (select (store (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_335)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) .cse3)))) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)) (= 400 .cse1) (< .cse1 400))))) (or (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) .cse0) (forall ((v_ArrVal_335 Int) (|v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| Int)) (or (not (<= (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61|)) (forall ((v_ArrVal_337 Int)) (let ((.cse5 (let ((.cse7 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (select (store (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse6 (+ (* (select .cse6 .cse7) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_335)) |v_t1Thread1of1ForFork1_write~int_#ptr#1.offset_61| v_ArrVal_337) .cse7)))) (let ((.cse4 (* 4 .cse5))) (or (< (+ .cse4 |c_~#queue~0.offset| 4) 0) (= 400 .cse5) (< (+ .cse4 |c_~#queue~0.offset| 11) (select |c_#length| |c_~#queue~0.base|)))))))))) is different from false Received shutdown request... [2022-09-30 06:31:19,162 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 [2022-09-30 06:31:19,167 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-30 06:31:19,167 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 [2022-09-30 06:31:19,167 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 [2022-09-30 06:31:19,167 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-30 06:31:19,167 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-30 06:31:19,214 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-09-30 06:31:19,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-09-30 06:31:19,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-09-30 06:31:19,415 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 401 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 198 known predicates. [2022-09-30 06:31:19,416 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2022-09-30 06:31:19,416 INFO L307 ceAbstractionStarter]: Result for error location t1Err0ASSERT_VIOLATIONASSERT was TIMEOUT (4/4) [2022-09-30 06:31:19,419 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-30 06:31:19,419 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-30 06:31:19,422 INFO L202 PluginConnector]: Adding new model queue_ok_longer.line295.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 06:31:19 BasicIcfg [2022-09-30 06:31:19,422 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-30 06:31:19,424 INFO L158 Benchmark]: Toolchain (without parser) took 845101.16ms. Allocated memory was 194.0MB in the beginning and 475.0MB in the end (delta: 281.0MB). Free memory was 145.2MB in the beginning and 310.1MB in the end (delta: -164.8MB). Peak memory consumption was 116.3MB. Max. memory is 8.0GB. [2022-09-30 06:31:19,424 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.21ms. Allocated memory is still 194.0MB. Free memory is still 148.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-09-30 06:31:19,424 INFO L158 Benchmark]: Boogie Preprocessor took 92.51ms. Allocated memory is still 194.0MB. Free memory was 145.1MB in the beginning and 141.7MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-09-30 06:31:19,424 INFO L158 Benchmark]: RCFGBuilder took 892.77ms. Allocated memory is still 194.0MB. Free memory was 141.6MB in the beginning and 138.5MB in the end (delta: 3.2MB). Peak memory consumption was 11.1MB. Max. memory is 8.0GB. [2022-09-30 06:31:19,425 INFO L158 Benchmark]: TraceAbstraction took 844106.26ms. Allocated memory was 194.0MB in the beginning and 475.0MB in the end (delta: 281.0MB). Free memory was 137.7MB in the beginning and 310.1MB in the end (delta: -172.4MB). Peak memory consumption was 108.3MB. Max. memory is 8.0GB. [2022-09-30 06:31:19,430 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21ms. Allocated memory is still 194.0MB. Free memory is still 148.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 92.51ms. Allocated memory is still 194.0MB. Free memory was 145.1MB in the beginning and 141.7MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 892.77ms. Allocated memory is still 194.0MB. Free memory was 141.6MB in the beginning and 138.5MB in the end (delta: 3.2MB). Peak memory consumption was 11.1MB. Max. memory is 8.0GB. * TraceAbstraction took 844106.26ms. Allocated memory was 194.0MB in the beginning and 475.0MB in the end (delta: 281.0MB). Free memory was 137.7MB in the beginning and 310.1MB in the end (delta: -172.4MB). Peak memory consumption was 108.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 2, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1768, positive: 1674, positive conditional: 1674, positive unconditional: 0, negative: 94, negative conditional: 94, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1768, positive: 1674, positive conditional: 1674, positive unconditional: 0, negative: 94, negative conditional: 94, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1688, positive: 1674, positive conditional: 0, positive unconditional: 1674, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1651, positive: 1637, positive conditional: 0, positive unconditional: 1637, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1688, positive: 37, positive conditional: 0, positive unconditional: 37, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1651, unknown conditional: 0, unknown unconditional: 1651] , Statistics on independence cache: Total cache size (in pairs): 1651, Positive cache size: 1637, Positive conditional cache size: 0, Positive unconditional cache size: 1637, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Independence queries for same thread: 80, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 44, positive: 39, positive conditional: 39, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 808, positive: 776, positive conditional: 776, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 776, positive: 776, positive conditional: 0, positive unconditional: 776, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 167, positive: 167, positive conditional: 0, positive unconditional: 167, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 776, positive: 609, positive conditional: 0, positive unconditional: 609, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 167, unknown conditional: 0, unknown unconditional: 167] , Statistics on independence cache: Total cache size (in pairs): 39, Positive cache size: 39, Positive conditional cache size: 0, Positive unconditional cache size: 39, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 5, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 42, positive: 39, positive conditional: 39, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 808, positive: 776, positive conditional: 776, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 776, positive: 776, positive conditional: 0, positive unconditional: 776, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 167, positive: 167, positive conditional: 0, positive unconditional: 167, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 776, positive: 609, positive conditional: 0, positive unconditional: 609, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 167, unknown conditional: 0, unknown unconditional: 167] , Statistics on independence cache: Total cache size (in pairs): 39, Positive cache size: 39, Positive conditional cache size: 0, Positive unconditional cache size: 39, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 8, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 127, positive: 122, positive conditional: 122, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 808, positive: 776, positive conditional: 776, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 776, positive: 776, positive conditional: 0, positive unconditional: 776, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 167, positive: 167, positive conditional: 0, positive unconditional: 167, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 776, positive: 609, positive conditional: 0, positive unconditional: 609, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 167, unknown conditional: 0, unknown unconditional: 167] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 112, Positive conditional cache size: 0, Positive unconditional cache size: 112, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 13, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 138, positive: 133, positive conditional: 133, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 808, positive: 776, positive conditional: 776, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 776, positive: 776, positive conditional: 0, positive unconditional: 776, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 167, positive: 167, positive conditional: 0, positive unconditional: 167, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 776, positive: 609, positive conditional: 0, positive unconditional: 609, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 167, unknown conditional: 0, unknown unconditional: 167] , Statistics on independence cache: Total cache size (in pairs): 142, Positive cache size: 142, Positive conditional cache size: 0, Positive unconditional cache size: 142, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 18, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 223, positive: 216, positive conditional: 216, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 808, positive: 776, positive conditional: 776, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 776, positive: 776, positive conditional: 0, positive unconditional: 776, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 167, positive: 167, positive conditional: 0, positive unconditional: 167, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 776, positive: 609, positive conditional: 0, positive unconditional: 609, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 167, unknown conditional: 0, unknown unconditional: 167] , Statistics on independence cache: Total cache size (in pairs): 167, Positive cache size: 167, Positive conditional cache size: 0, Positive unconditional cache size: 167, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 25, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 234, positive: 227, positive conditional: 227, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 808, positive: 776, positive conditional: 776, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 776, positive: 776, positive conditional: 0, positive unconditional: 776, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 167, positive: 167, positive conditional: 0, positive unconditional: 167, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 776, positive: 609, positive conditional: 0, positive unconditional: 609, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 167, unknown conditional: 0, unknown unconditional: 167] , Statistics on independence cache: Total cache size (in pairs): 167, Positive cache size: 167, Positive conditional cache size: 0, Positive unconditional cache size: 167, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 32, Statistics for Abstraction: - TimeoutResultAtElement [Line: 295]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PartialOrderCegarLoop was analyzing trace of length 401 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 198 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 810 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 810 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.4s, 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: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: t1Err0ASSERT_VIOLATIONASSERT with 1 thread instances CFG has 5 procedures, 810 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, 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: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: t1Err0ASSERT_VIOLATIONASSERT with 2 thread instances CFG has 5 procedures, 810 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 843.2s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 51.3s, 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: 231, 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.6s SatisfiabilityAnalysisTime, 390.8s InterpolantComputationTime, 2422 NumberOfCodeBlocks, 2422 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 3109 ConstructedInterpolants, 558 QuantifiedInterpolants, 77556 SizeOfPredicates, 257 NumberOfNonLiveVariables, 2192 ConjunctsInSsa, 384 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 206/458 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