/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/04-mutex_44-malloc_sound.line361.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-03 12:03:36,054 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-03 12:03:36,057 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-03 12:03:36,083 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-03 12:03:36,083 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-03 12:03:36,084 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-03 12:03:36,085 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-03 12:03:36,086 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-03 12:03:36,092 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-03 12:03:36,096 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-03 12:03:36,097 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-03 12:03:36,099 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-03 12:03:36,099 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-03 12:03:36,101 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-03 12:03:36,102 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-03 12:03:36,104 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-03 12:03:36,105 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-03 12:03:36,105 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-03 12:03:36,108 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-03 12:03:36,115 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-03 12:03:36,116 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-03 12:03:36,118 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-03 12:03:36,120 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-03 12:03:36,120 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-03 12:03:36,124 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-03 12:03:36,124 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-03 12:03:36,125 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-03 12:03:36,125 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-03 12:03:36,125 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-03 12:03:36,126 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-03 12:03:36,126 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-03 12:03:36,126 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-03 12:03:36,127 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-03 12:03:36,127 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-03 12:03:36,128 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-03 12:03:36,128 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-03 12:03:36,129 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-03 12:03:36,129 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-03 12:03:36,129 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-03 12:03:36,130 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-03 12:03:36,130 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-03 12:03:36,134 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-10-03 12:03:36,170 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-03 12:03:36,170 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-03 12:03:36,170 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-03 12:03:36,171 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-03 12:03:36,171 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-03 12:03:36,171 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-03 12:03:36,172 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-03 12:03:36,172 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-03 12:03:36,172 INFO L138 SettingsManager]: * Use SBE=true [2022-10-03 12:03:36,172 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-03 12:03:36,173 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-03 12:03:36,174 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-03 12:03:36,174 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-03 12:03:36,174 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-03 12:03:36,174 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-03 12:03:36,174 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-03 12:03:36,174 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-03 12:03:36,174 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-03 12:03:36,174 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-03 12:03:36,174 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-03 12:03:36,175 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-03 12:03:36,175 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-03 12:03:36,175 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-03 12:03:36,175 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-03 12:03:36,175 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-03 12:03:36,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 12:03:36,175 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-03 12:03:36,175 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-03 12:03:36,176 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-03 12:03:36,176 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-03 12:03:36,176 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-03 12:03:36,176 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-03 12:03:36,176 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-03 12:03:36,176 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-03 12:03:36,177 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-03 12:03:36,177 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-03 12:03:36,177 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-03 12:03:36,177 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-03 12:03:36,177 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-10-03 12:03:36,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-03 12:03:36,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-03 12:03:36,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-03 12:03:36,412 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-03 12:03:36,413 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-03 12:03:36,414 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/04-mutex_44-malloc_sound.line361.bpl [2022-10-03 12:03:36,415 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/04-mutex_44-malloc_sound.line361.bpl' [2022-10-03 12:03:36,448 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-03 12:03:36,449 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-03 12:03:36,450 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-03 12:03:36,450 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-03 12:03:36,450 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-03 12:03:36,463 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "04-mutex_44-malloc_sound.line361.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 12:03:36" (1/1) ... [2022-10-03 12:03:36,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "04-mutex_44-malloc_sound.line361.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 12:03:36" (1/1) ... [2022-10-03 12:03:36,482 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "04-mutex_44-malloc_sound.line361.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 12:03:36" (1/1) ... [2022-10-03 12:03:36,483 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "04-mutex_44-malloc_sound.line361.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 12:03:36" (1/1) ... [2022-10-03 12:03:36,497 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "04-mutex_44-malloc_sound.line361.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 12:03:36" (1/1) ... [2022-10-03 12:03:36,499 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "04-mutex_44-malloc_sound.line361.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 12:03:36" (1/1) ... [2022-10-03 12:03:36,500 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "04-mutex_44-malloc_sound.line361.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 12:03:36" (1/1) ... [2022-10-03 12:03:36,506 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-03 12:03:36,508 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-03 12:03:36,508 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-03 12:03:36,508 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-03 12:03:36,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "04-mutex_44-malloc_sound.line361.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 12:03:36" (1/1) ... [2022-10-03 12:03:36,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 12:03:36,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 12:03:36,534 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-10-03 12:03:36,559 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-10-03 12:03:36,577 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-10-03 12:03:36,578 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-10-03 12:03:36,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-03 12:03:36,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-03 12:03:36,579 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-03 12:03:36,670 INFO L234 CfgBuilder]: Building ICFG [2022-10-03 12:03:36,671 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-03 12:03:36,950 INFO L275 CfgBuilder]: Performing block encoding [2022-10-03 12:03:36,957 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-03 12:03:36,957 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-10-03 12:03:36,959 INFO L202 PluginConnector]: Adding new model 04-mutex_44-malloc_sound.line361.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 12:03:36 BoogieIcfgContainer [2022-10-03 12:03:36,959 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-03 12:03:36,960 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-03 12:03:36,960 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-03 12:03:36,967 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-03 12:03:36,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "04-mutex_44-malloc_sound.line361.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 12:03:36" (1/2) ... [2022-10-03 12:03:36,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ec5b86d and model type 04-mutex_44-malloc_sound.line361.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 12:03:36, skipping insertion in model container [2022-10-03 12:03:36,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "04-mutex_44-malloc_sound.line361.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 12:03:36" (2/2) ... [2022-10-03 12:03:36,970 INFO L112 eAbstractionObserver]: Analyzing ICFG 04-mutex_44-malloc_sound.line361.bpl [2022-10-03 12:03:36,979 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-03 12:03:36,987 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-03 12:03:36,987 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-03 12:03:36,987 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-03 12:03:37,050 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-10-03 12:03:37,098 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 12:03:37,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 12:03:37,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 12:03:37,110 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-10-03 12:03:37,111 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-10-03 12:03:37,143 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 12:03:37,148 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONASSERT ======== [2022-10-03 12:03:37,153 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;@3d796d65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 12:03:37,153 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 12:03:37,183 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 12:03:37,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 12:03:37,187 INFO L85 PathProgramCache]: Analyzing trace with hash 196016494, now seen corresponding path program 1 times [2022-10-03 12:03:37,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 12:03:37,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440948848] [2022-10-03 12:03:37,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 12:03:37,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 12:03:37,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 12:03:37,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 12:03:37,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 12:03:37,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440948848] [2022-10-03 12:03:37,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440948848] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 12:03:37,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 12:03:37,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-03 12:03:37,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075078340] [2022-10-03 12:03:37,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 12:03:37,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-03 12:03:37,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 12:03:37,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-03 12:03:37,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-03 12:03:37,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:03:37,412 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 12:03:37,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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-10-03 12:03:37,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:03:37,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:03:37,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-03 12:03:37,435 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 12:03:37,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 12:03:37,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1083520175, now seen corresponding path program 1 times [2022-10-03 12:03:37,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 12:03:37,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166761698] [2022-10-03 12:03:37,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 12:03:37,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 12:03:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 12:03:37,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 12:03:37,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 12:03:37,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166761698] [2022-10-03 12:03:37,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166761698] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 12:03:37,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 12:03:37,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-03 12:03:37,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516094127] [2022-10-03 12:03:37,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 12:03:37,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-03 12:03:37,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 12:03:37,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-03 12:03:37,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-03 12:03:37,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:03:37,624 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 12:03:37,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-10-03 12:03:37,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:03:37,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:03:37,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:03:37,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-03 12:03:37,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-03 12:03:37,692 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 12:03:37,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 12:03:37,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1657544080, now seen corresponding path program 1 times [2022-10-03 12:03:37,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 12:03:37,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958954511] [2022-10-03 12:03:37,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 12:03:37,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 12:03:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 12:03:37,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 12:03:37,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 12:03:37,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958954511] [2022-10-03 12:03:37,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958954511] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 12:03:37,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054370603] [2022-10-03 12:03:37,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 12:03:37,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 12:03:37,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 12:03:37,919 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 12:03:37,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-03 12:03:38,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 12:03:38,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-03 12:03:38,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 12:03:38,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 12:03:38,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 12:03:38,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 12:03:38,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054370603] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 12:03:38,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 12:03:38,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-10-03 12:03:38,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85886178] [2022-10-03 12:03:38,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 12:03:38,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-03 12:03:38,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 12:03:38,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-03 12:03:38,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-10-03 12:03:38,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:03:38,316 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 12:03:38,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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-10-03 12:03:38,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:03:38,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-03 12:03:38,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:03:38,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:03:38,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-03 12:03:38,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-03 12:03:38,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-10-03 12:03:38,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-10-03 12:03:38,740 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 12:03:38,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 12:03:38,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1103270674, now seen corresponding path program 2 times [2022-10-03 12:03:38,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 12:03:38,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918595630] [2022-10-03 12:03:38,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 12:03:38,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 12:03:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 12:03:38,982 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 12:03:38,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 12:03:38,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918595630] [2022-10-03 12:03:38,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918595630] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 12:03:38,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491905715] [2022-10-03 12:03:38,983 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-03 12:03:38,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 12:03:38,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 12:03:38,990 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 12:03:39,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-03 12:03:39,070 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-03 12:03:39,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-03 12:03:39,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-03 12:03:39,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 12:03:39,170 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 12:03:39,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 12:03:39,285 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 12:03:39,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491905715] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 12:03:39,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 12:03:39,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-10-03 12:03:39,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770134582] [2022-10-03 12:03:39,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 12:03:39,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-10-03 12:03:39,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 12:03:39,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-10-03 12:03:39,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-10-03 12:03:39,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:03:39,291 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 12:03:39,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 10.61111111111111) internal successors, (191), 18 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 12:03:39,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:03:39,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-03 12:03:39,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-10-03 12:03:39,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:03:39,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:03:39,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-03 12:03:39,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-03 12:03:39,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-10-03 12:03:39,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-03 12:03:39,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 12:03:39,664 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 12:03:39,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 12:03:39,665 INFO L85 PathProgramCache]: Analyzing trace with hash -668707074, now seen corresponding path program 1 times [2022-10-03 12:03:39,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 12:03:39,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697161165] [2022-10-03 12:03:39,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 12:03:39,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 12:03:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 12:03:39,782 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 318 proven. 1 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-10-03 12:03:39,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 12:03:39,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697161165] [2022-10-03 12:03:39,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697161165] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 12:03:39,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829483425] [2022-10-03 12:03:39,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 12:03:39,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 12:03:39,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 12:03:39,784 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 12:03:39,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-03 12:03:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 12:03:39,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-03 12:03:39,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 12:03:39,940 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 318 proven. 1 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-10-03 12:03:39,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 12:03:39,996 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 318 proven. 1 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-10-03 12:03:39,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829483425] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 12:03:39,996 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 12:03:39,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-10-03 12:03:39,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529712454] [2022-10-03 12:03:39,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 12:03:39,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-03 12:03:39,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 12:03:39,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-03 12:03:39,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-10-03 12:03:39,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:03:39,998 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 12:03:39,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.25) internal successors, (130), 8 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 12:03:39,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:03:39,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-03 12:03:39,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-10-03 12:03:39,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-10-03 12:03:39,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:03:40,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:03:40,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-03 12:03:40,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-03 12:03:40,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-10-03 12:03:40,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-03 12:03:40,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-03 12:03:40,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 12:03:40,290 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 12:03:40,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 12:03:40,291 INFO L85 PathProgramCache]: Analyzing trace with hash -534831428, now seen corresponding path program 2 times [2022-10-03 12:03:40,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 12:03:40,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506086268] [2022-10-03 12:03:40,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 12:03:40,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 12:03:40,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 12:03:40,437 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 582 proven. 69 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-10-03 12:03:40,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 12:03:40,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506086268] [2022-10-03 12:03:40,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506086268] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 12:03:40,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157225011] [2022-10-03 12:03:40,438 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-03 12:03:40,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 12:03:40,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 12:03:40,439 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-10-03 12:03:40,440 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-10-03 12:03:40,536 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-03 12:03:40,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-03 12:03:40,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-03 12:03:40,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 12:03:40,613 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 582 proven. 69 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-10-03 12:03:40,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 12:03:40,702 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 582 proven. 69 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-10-03 12:03:40,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157225011] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 12:03:40,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 12:03:40,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2022-10-03 12:03:40,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877813866] [2022-10-03 12:03:40,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 12:03:40,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-03 12:03:40,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 12:03:40,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-03 12:03:40,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-10-03 12:03:40,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:03:40,705 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 12:03:40,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.555555555555557) internal successors, (149), 9 states have internal predecessors, (149), 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-10-03 12:03:40,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:03:40,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-03 12:03:40,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-10-03 12:03:40,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-10-03 12:03:40,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-10-03 12:03:40,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:03:40,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:03:40,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-03 12:03:40,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-03 12:03:40,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-10-03 12:03:40,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-03 12:03:40,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-03 12:03:40,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-03 12:03:40,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 12:03:40,995 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 12:03:40,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 12:03:40,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1823245125, now seen corresponding path program 3 times [2022-10-03 12:03:40,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 12:03:40,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800990579] [2022-10-03 12:03:40,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 12:03:40,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 12:03:41,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 12:03:42,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1000 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2022-10-03 12:03:42,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 12:03:42,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800990579] [2022-10-03 12:03:42,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800990579] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 12:03:42,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092709339] [2022-10-03 12:03:42,284 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-03 12:03:42,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 12:03:42,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 12:03:42,295 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-10-03 12:03:42,327 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-10-03 12:03:42,811 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-10-03 12:03:42,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-03 12:03:42,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 46 conjunts are in the unsatisfiable core [2022-10-03 12:03:42,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 12:03:43,393 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-10-03 12:03:43,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 12:03:43,571 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-10-03 12:03:43,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 12:03:43,723 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-10-03 12:03:43,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 12:03:43,888 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-10-03 12:03:44,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 12:03:44,041 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-10-03 12:03:44,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 12:03:44,206 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-10-03 12:03:44,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 12:03:44,376 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-10-03 12:03:44,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 12:03:44,555 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-10-03 12:03:44,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 12:03:44,670 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-10-03 12:03:44,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 12:03:44,811 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-10-03 12:03:44,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 12:03:44,954 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-10-03 12:03:45,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1000 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 891 trivial. 0 not checked. [2022-10-03 12:03:45,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 12:03:51,092 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_main_~#t1~0#1.offset|) (forall ((|ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (not (< |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_274 Int) (v_subst_1 Int)) (or (forall ((v_ArrVal_275 Int)) (< (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) (select (store (store |c_ULTIMATE.start_#Ultimate.allocOnHeap_old_#length#1| |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_274) v_subst_1 v_ArrVal_275) |c_ULTIMATE.start_main_~#t1~0#1.base|))) (not (< v_subst_1 |c_#StackHeapBarrier|))))))) is different from false [2022-10-03 12:03:53,300 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_main_~#t1~0#1.offset|) (forall ((|ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (not (< |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_274 Int) (v_subst_1 Int)) (or (forall ((v_ArrVal_275 Int)) (< (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) (select (store (store |c_#length| |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_274) v_subst_1 v_ArrVal_275) |c_ULTIMATE.start_main_~#t1~0#1.base|))) (not (< v_subst_1 |c_#StackHeapBarrier|))))))) is different from false [2022-10-03 12:04:13,677 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_main_~#t1~0#1.offset|) (forall ((|ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (forall ((v_ArrVal_273 Int) (v_subst_2 Int)) (or (not (< v_subst_2 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_274 Int) (v_subst_1 Int)) (or (forall ((v_ArrVal_275 Int)) (< (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) (select (store (store (store |c_ULTIMATE.start_#Ultimate.allocOnHeap_old_#length#1| |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_273) v_subst_2 v_ArrVal_274) v_subst_1 v_ArrVal_275) |c_ULTIMATE.start_main_~#t1~0#1.base|))) (not (< v_subst_1 |c_#StackHeapBarrier|)))))) (not (< |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|))))) is different from false [2022-10-03 12:04:15,924 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_main_~#t1~0#1.offset|) (forall ((|ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (not (< |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_273 Int) (v_subst_2 Int)) (or (forall ((v_ArrVal_274 Int) (v_subst_1 Int)) (or (forall ((v_ArrVal_275 Int)) (< (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) (select (store (store (store |c_#length| |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_273) v_subst_2 v_ArrVal_274) v_subst_1 v_ArrVal_275) |c_ULTIMATE.start_main_~#t1~0#1.base|))) (not (< v_subst_1 |c_#StackHeapBarrier|)))) (not (< v_subst_2 |c_#StackHeapBarrier|))))))) is different from false [2022-10-03 12:04:40,403 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_main_~#t1~0#1.offset|) (forall ((|ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (forall ((v_ArrVal_272 Int) (v_subst_3 Int)) (or (forall ((v_ArrVal_273 Int) (v_subst_2 Int)) (or (forall ((v_ArrVal_274 Int) (v_subst_1 Int)) (or (forall ((v_ArrVal_275 Int)) (< (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) (select (store (store (store (store |c_ULTIMATE.start_#Ultimate.allocOnHeap_old_#length#1| |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_272) v_subst_3 v_ArrVal_273) v_subst_2 v_ArrVal_274) v_subst_1 v_ArrVal_275) |c_ULTIMATE.start_main_~#t1~0#1.base|))) (not (< v_subst_1 |c_#StackHeapBarrier|)))) (not (< v_subst_2 |c_#StackHeapBarrier|)))) (not (< v_subst_3 |c_#StackHeapBarrier|)))) (not (< |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|))))) is different from false [2022-10-03 12:04:42,760 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_main_~#t1~0#1.offset|) (forall ((|ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (not (< |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_272 Int) (v_subst_3 Int)) (or (not (< v_subst_3 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_273 Int) (v_subst_2 Int)) (or (forall ((v_ArrVal_274 Int) (v_subst_1 Int)) (or (forall ((v_ArrVal_275 Int)) (< (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) (select (store (store (store (store |c_#length| |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_272) v_subst_3 v_ArrVal_273) v_subst_2 v_ArrVal_274) v_subst_1 v_ArrVal_275) |c_ULTIMATE.start_main_~#t1~0#1.base|))) (not (< v_subst_1 |c_#StackHeapBarrier|)))) (not (< v_subst_2 |c_#StackHeapBarrier|))))))))) is different from false [2022-10-03 12:04:45,188 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_main_~#t1~0#1.offset|) (forall ((v_ArrVal_271 Int) (v_subst_4 Int)) (or (not (< v_subst_4 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_272 Int) (v_subst_3 Int)) (or (forall ((v_ArrVal_273 Int) (v_subst_2 Int)) (or (forall ((v_ArrVal_274 Int) (v_subst_1 Int)) (or (forall ((v_ArrVal_275 Int)) (< (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) (select (store (store (store (store (store |c_ULTIMATE.start_#Ultimate.allocOnHeap_old_#length#1| |c_ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_271) v_subst_4 v_ArrVal_272) v_subst_3 v_ArrVal_273) v_subst_2 v_ArrVal_274) v_subst_1 v_ArrVal_275) |c_ULTIMATE.start_main_~#t1~0#1.base|))) (not (< v_subst_1 |c_#StackHeapBarrier|)))) (not (< v_subst_2 |c_#StackHeapBarrier|)))) (not (< v_subst_3 |c_#StackHeapBarrier|))))))) is different from false [2022-10-03 12:04:47,251 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_main_~#t1~0#1.offset|) (forall ((|ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (forall ((v_ArrVal_271 Int) (v_subst_4 Int)) (or (not (< v_subst_4 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_272 Int) (v_subst_3 Int)) (or (not (< v_subst_3 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_273 Int) (v_subst_2 Int)) (or (forall ((v_ArrVal_274 Int) (v_subst_1 Int)) (or (forall ((v_ArrVal_275 Int)) (< (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) (select (store (store (store (store (store |c_ULTIMATE.start_#Ultimate.allocOnHeap_old_#length#1| |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_271) v_subst_4 v_ArrVal_272) v_subst_3 v_ArrVal_273) v_subst_2 v_ArrVal_274) v_subst_1 v_ArrVal_275) |c_ULTIMATE.start_main_~#t1~0#1.base|))) (not (< v_subst_1 |c_#StackHeapBarrier|)))) (not (< v_subst_2 |c_#StackHeapBarrier|)))))))) (not (< |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|))))) is different from false [2022-10-03 12:04:49,716 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_main_~#t1~0#1.offset|) (forall ((|ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (not (< |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_271 Int) (v_subst_4 Int)) (or (not (< v_subst_4 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_272 Int) (v_subst_3 Int)) (or (not (< v_subst_3 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_273 Int) (v_subst_2 Int)) (or (forall ((v_ArrVal_274 Int) (v_subst_1 Int)) (or (forall ((v_ArrVal_275 Int)) (< (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) (select (store (store (store (store (store |c_#length| |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_271) v_subst_4 v_ArrVal_272) v_subst_3 v_ArrVal_273) v_subst_2 v_ArrVal_274) v_subst_1 v_ArrVal_275) |c_ULTIMATE.start_main_~#t1~0#1.base|))) (not (< v_subst_1 |c_#StackHeapBarrier|)))) (not (< v_subst_2 |c_#StackHeapBarrier|))))))))))) is different from false [2022-10-03 12:05:20,608 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_main_~#t1~0#1.offset|) (forall ((|ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (not (< |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (forall ((v_subst_5 Int) (v_ArrVal_270 Int)) (or (not (< v_subst_5 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_271 Int) (v_subst_4 Int)) (or (not (< v_subst_4 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_272 Int) (v_subst_3 Int)) (or (forall ((v_ArrVal_273 Int) (v_subst_2 Int)) (or (not (< v_subst_2 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_274 Int) (v_subst_1 Int)) (or (forall ((v_ArrVal_275 Int)) (< (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) (select (store (store (store (store (store (store |c_ULTIMATE.start_#Ultimate.allocOnHeap_old_#length#1| |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_270) v_subst_5 v_ArrVal_271) v_subst_4 v_ArrVal_272) v_subst_3 v_ArrVal_273) v_subst_2 v_ArrVal_274) v_subst_1 v_ArrVal_275) |c_ULTIMATE.start_main_~#t1~0#1.base|))) (not (< v_subst_1 |c_#StackHeapBarrier|)))))) (not (< v_subst_3 |c_#StackHeapBarrier|))))))))))) is different from false [2022-10-03 12:05:23,180 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_main_~#t1~0#1.offset|) (forall ((|ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (forall ((v_subst_5 Int) (v_ArrVal_270 Int)) (or (not (< v_subst_5 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_271 Int) (v_subst_4 Int)) (or (not (< v_subst_4 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_272 Int) (v_subst_3 Int)) (or (forall ((v_ArrVal_273 Int) (v_subst_2 Int)) (or (forall ((v_ArrVal_274 Int) (v_subst_1 Int)) (or (forall ((v_ArrVal_275 Int)) (< (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) (select (store (store (store (store (store (store |c_#length| |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_270) v_subst_5 v_ArrVal_271) v_subst_4 v_ArrVal_272) v_subst_3 v_ArrVal_273) v_subst_2 v_ArrVal_274) v_subst_1 v_ArrVal_275) |c_ULTIMATE.start_main_~#t1~0#1.base|))) (not (< v_subst_1 |c_#StackHeapBarrier|)))) (not (< v_subst_2 |c_#StackHeapBarrier|)))) (not (< v_subst_3 |c_#StackHeapBarrier|)))))))) (not (< |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|))))) is different from false [2022-10-03 12:05:55,891 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_main_~#t1~0#1.offset|) (forall ((|ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (not (< |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_269 Int) (v_subst_6 Int)) (or (not (< v_subst_6 |c_#StackHeapBarrier|)) (forall ((v_subst_5 Int) (v_ArrVal_270 Int)) (or (not (< v_subst_5 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_271 Int) (v_subst_4 Int)) (or (not (< v_subst_4 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_272 Int) (v_subst_3 Int)) (or (not (< v_subst_3 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_273 Int) (v_subst_2 Int)) (or (forall ((v_ArrVal_274 Int) (v_subst_1 Int)) (or (forall ((v_ArrVal_275 Int)) (< (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) (select (store (store (store (store (store (store (store |c_ULTIMATE.start_#Ultimate.allocOnHeap_old_#length#1| |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_269) v_subst_6 v_ArrVal_270) v_subst_5 v_ArrVal_271) v_subst_4 v_ArrVal_272) v_subst_3 v_ArrVal_273) v_subst_2 v_ArrVal_274) v_subst_1 v_ArrVal_275) |c_ULTIMATE.start_main_~#t1~0#1.base|))) (not (< v_subst_1 |c_#StackHeapBarrier|)))) (not (< v_subst_2 |c_#StackHeapBarrier|))))))))))))))) is different from false [2022-10-03 12:05:58,376 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_main_~#t1~0#1.offset|) (forall ((|ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (forall ((v_ArrVal_269 Int) (v_subst_6 Int)) (or (not (< v_subst_6 |c_#StackHeapBarrier|)) (forall ((v_subst_5 Int) (v_ArrVal_270 Int)) (or (forall ((v_ArrVal_271 Int) (v_subst_4 Int)) (or (forall ((v_ArrVal_272 Int) (v_subst_3 Int)) (or (not (< v_subst_3 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_273 Int) (v_subst_2 Int)) (or (forall ((v_ArrVal_274 Int) (v_subst_1 Int)) (or (forall ((v_ArrVal_275 Int)) (< (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) (select (store (store (store (store (store (store (store |c_#length| |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_269) v_subst_6 v_ArrVal_270) v_subst_5 v_ArrVal_271) v_subst_4 v_ArrVal_272) v_subst_3 v_ArrVal_273) v_subst_2 v_ArrVal_274) v_subst_1 v_ArrVal_275) |c_ULTIMATE.start_main_~#t1~0#1.base|))) (not (< v_subst_1 |c_#StackHeapBarrier|)))) (not (< v_subst_2 |c_#StackHeapBarrier|)))))) (not (< v_subst_4 |c_#StackHeapBarrier|)))) (not (< v_subst_5 |c_#StackHeapBarrier|)))))) (not (< |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|))))) is different from false [2022-10-03 12:06:00,891 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_main_~#t1~0#1.offset|) (forall ((v_ArrVal_268 Int) (v_subst_7 Int)) (or (forall ((v_ArrVal_269 Int) (v_subst_6 Int)) (or (not (< v_subst_6 |c_#StackHeapBarrier|)) (forall ((v_subst_5 Int) (v_ArrVal_270 Int)) (or (not (< v_subst_5 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_271 Int) (v_subst_4 Int)) (or (not (< v_subst_4 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_272 Int) (v_subst_3 Int)) (or (forall ((v_ArrVal_273 Int) (v_subst_2 Int)) (or (forall ((v_ArrVal_274 Int) (v_subst_1 Int)) (or (forall ((v_ArrVal_275 Int)) (< (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) (select (store (store (store (store (store (store (store (store |c_ULTIMATE.start_#Ultimate.allocOnHeap_old_#length#1| |c_ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_268) v_subst_7 v_ArrVal_269) v_subst_6 v_ArrVal_270) v_subst_5 v_ArrVal_271) v_subst_4 v_ArrVal_272) v_subst_3 v_ArrVal_273) v_subst_2 v_ArrVal_274) v_subst_1 v_ArrVal_275) |c_ULTIMATE.start_main_~#t1~0#1.base|))) (not (< v_subst_1 |c_#StackHeapBarrier|)))) (not (< v_subst_2 |c_#StackHeapBarrier|)))) (not (< v_subst_3 |c_#StackHeapBarrier|)))))))))) (not (< v_subst_7 |c_#StackHeapBarrier|))))) is different from false [2022-10-03 12:06:02,943 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_main_~#t1~0#1.offset|) (forall ((|ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (not (< |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_268 Int) (v_subst_7 Int)) (or (not (< v_subst_7 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_269 Int) (v_subst_6 Int)) (or (not (< v_subst_6 |c_#StackHeapBarrier|)) (forall ((v_subst_5 Int) (v_ArrVal_270 Int)) (or (not (< v_subst_5 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_271 Int) (v_subst_4 Int)) (or (not (< v_subst_4 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_272 Int) (v_subst_3 Int)) (or (not (< v_subst_3 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_273 Int) (v_subst_2 Int)) (or (forall ((v_ArrVal_274 Int) (v_subst_1 Int)) (or (forall ((v_ArrVal_275 Int)) (< (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) (select (store (store (store (store (store (store (store (store |c_ULTIMATE.start_#Ultimate.allocOnHeap_old_#length#1| |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_268) v_subst_7 v_ArrVal_269) v_subst_6 v_ArrVal_270) v_subst_5 v_ArrVal_271) v_subst_4 v_ArrVal_272) v_subst_3 v_ArrVal_273) v_subst_2 v_ArrVal_274) v_subst_1 v_ArrVal_275) |c_ULTIMATE.start_main_~#t1~0#1.base|))) (not (< v_subst_1 |c_#StackHeapBarrier|)))) (not (< v_subst_2 |c_#StackHeapBarrier|))))))))))))))))) is different from false [2022-10-03 12:06:05,483 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_main_~#t1~0#1.offset|) (forall ((|ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (not (< |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_268 Int) (v_subst_7 Int)) (or (forall ((v_ArrVal_269 Int) (v_subst_6 Int)) (or (not (< v_subst_6 |c_#StackHeapBarrier|)) (forall ((v_subst_5 Int) (v_ArrVal_270 Int)) (or (not (< v_subst_5 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_271 Int) (v_subst_4 Int)) (or (not (< v_subst_4 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_272 Int) (v_subst_3 Int)) (or (not (< v_subst_3 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_273 Int) (v_subst_2 Int)) (or (not (< v_subst_2 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_274 Int) (v_subst_1 Int)) (or (forall ((v_ArrVal_275 Int)) (< (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) (select (store (store (store (store (store (store (store (store |c_#length| |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_268) v_subst_7 v_ArrVal_269) v_subst_6 v_ArrVal_270) v_subst_5 v_ArrVal_271) v_subst_4 v_ArrVal_272) v_subst_3 v_ArrVal_273) v_subst_2 v_ArrVal_274) v_subst_1 v_ArrVal_275) |c_ULTIMATE.start_main_~#t1~0#1.base|))) (not (< v_subst_1 |c_#StackHeapBarrier|)))))))))))))) (not (< v_subst_7 |c_#StackHeapBarrier|))))))) is different from false [2022-10-03 12:06:08,238 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_main_~#t1~0#1.offset|) (forall ((v_ArrVal_267 Int) (v_subst_8 Int)) (or (forall ((v_ArrVal_268 Int) (v_subst_7 Int)) (or (not (< v_subst_7 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_269 Int) (v_subst_6 Int)) (or (not (< v_subst_6 |c_#StackHeapBarrier|)) (forall ((v_subst_5 Int) (v_ArrVal_270 Int)) (or (not (< v_subst_5 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_271 Int) (v_subst_4 Int)) (or (not (< v_subst_4 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_272 Int) (v_subst_3 Int)) (or (forall ((v_ArrVal_273 Int) (v_subst_2 Int)) (or (forall ((v_ArrVal_274 Int) (v_subst_1 Int)) (or (forall ((v_ArrVal_275 Int)) (< (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) (select (store (store (store (store (store (store (store (store (store |c_ULTIMATE.start_#Ultimate.allocOnHeap_old_#length#1| |c_ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_267) v_subst_8 v_ArrVal_268) v_subst_7 v_ArrVal_269) v_subst_6 v_ArrVal_270) v_subst_5 v_ArrVal_271) v_subst_4 v_ArrVal_272) v_subst_3 v_ArrVal_273) v_subst_2 v_ArrVal_274) v_subst_1 v_ArrVal_275) |c_ULTIMATE.start_main_~#t1~0#1.base|))) (not (< v_subst_1 |c_#StackHeapBarrier|)))) (not (< v_subst_2 |c_#StackHeapBarrier|)))) (not (< v_subst_3 |c_#StackHeapBarrier|)))))))))))) (not (< v_subst_8 |c_#StackHeapBarrier|))))) is different from false [2022-10-03 12:06:10,314 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_main_~#t1~0#1.offset|) (forall ((|ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (not (< |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_267 Int) (v_subst_8 Int)) (or (forall ((v_ArrVal_268 Int) (v_subst_7 Int)) (or (not (< v_subst_7 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_269 Int) (v_subst_6 Int)) (or (not (< v_subst_6 |c_#StackHeapBarrier|)) (forall ((v_subst_5 Int) (v_ArrVal_270 Int)) (or (not (< v_subst_5 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_271 Int) (v_subst_4 Int)) (or (not (< v_subst_4 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_272 Int) (v_subst_3 Int)) (or (not (< v_subst_3 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_273 Int) (v_subst_2 Int)) (or (forall ((v_ArrVal_274 Int) (v_subst_1 Int)) (or (forall ((v_ArrVal_275 Int)) (< (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) (select (store (store (store (store (store (store (store (store (store |c_ULTIMATE.start_#Ultimate.allocOnHeap_old_#length#1| |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_267) v_subst_8 v_ArrVal_268) v_subst_7 v_ArrVal_269) v_subst_6 v_ArrVal_270) v_subst_5 v_ArrVal_271) v_subst_4 v_ArrVal_272) v_subst_3 v_ArrVal_273) v_subst_2 v_ArrVal_274) v_subst_1 v_ArrVal_275) |c_ULTIMATE.start_main_~#t1~0#1.base|))) (not (< v_subst_1 |c_#StackHeapBarrier|)))) (not (< v_subst_2 |c_#StackHeapBarrier|)))))))))))))) (not (< v_subst_8 |c_#StackHeapBarrier|))))))) is different from false [2022-10-03 12:06:13,040 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_main_~#t1~0#1.offset|) (forall ((|ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (forall ((v_ArrVal_267 Int) (v_subst_8 Int)) (or (not (< v_subst_8 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_268 Int) (v_subst_7 Int)) (or (not (< v_subst_7 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_269 Int) (v_subst_6 Int)) (or (not (< v_subst_6 |c_#StackHeapBarrier|)) (forall ((v_subst_5 Int) (v_ArrVal_270 Int)) (or (not (< v_subst_5 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_271 Int) (v_subst_4 Int)) (or (forall ((v_ArrVal_272 Int) (v_subst_3 Int)) (or (not (< v_subst_3 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_273 Int) (v_subst_2 Int)) (or (forall ((v_ArrVal_274 Int) (v_subst_1 Int)) (or (forall ((v_ArrVal_275 Int)) (< (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) (select (store (store (store (store (store (store (store (store (store |c_#length| |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_267) v_subst_8 v_ArrVal_268) v_subst_7 v_ArrVal_269) v_subst_6 v_ArrVal_270) v_subst_5 v_ArrVal_271) v_subst_4 v_ArrVal_272) v_subst_3 v_ArrVal_273) v_subst_2 v_ArrVal_274) v_subst_1 v_ArrVal_275) |c_ULTIMATE.start_main_~#t1~0#1.base|))) (not (< v_subst_1 |c_#StackHeapBarrier|)))) (not (< v_subst_2 |c_#StackHeapBarrier|)))))) (not (< v_subst_4 |c_#StackHeapBarrier|)))))))))))) (not (< |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|))))) is different from false [2022-10-03 12:06:50,640 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_main_~#t1~0#1.offset|) (forall ((|ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (not (< |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_266 Int) (v_subst_9 Int)) (or (forall ((v_ArrVal_267 Int) (v_subst_8 Int)) (or (forall ((v_ArrVal_268 Int) (v_subst_7 Int)) (or (not (< v_subst_7 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_269 Int) (v_subst_6 Int)) (or (forall ((v_subst_5 Int) (v_ArrVal_270 Int)) (or (not (< v_subst_5 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_271 Int) (v_subst_4 Int)) (or (not (< v_subst_4 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_272 Int) (v_subst_3 Int)) (or (forall ((v_ArrVal_273 Int) (v_subst_2 Int)) (or (forall ((v_ArrVal_274 Int) (v_subst_1 Int)) (or (forall ((v_ArrVal_275 Int)) (< (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) (select (store (store (store (store (store (store (store (store (store (store |c_ULTIMATE.start_#Ultimate.allocOnHeap_old_#length#1| |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_266) v_subst_9 v_ArrVal_267) v_subst_8 v_ArrVal_268) v_subst_7 v_ArrVal_269) v_subst_6 v_ArrVal_270) v_subst_5 v_ArrVal_271) v_subst_4 v_ArrVal_272) v_subst_3 v_ArrVal_273) v_subst_2 v_ArrVal_274) v_subst_1 v_ArrVal_275) |c_ULTIMATE.start_main_~#t1~0#1.base|))) (not (< v_subst_1 |c_#StackHeapBarrier|)))) (not (< v_subst_2 |c_#StackHeapBarrier|)))) (not (< v_subst_3 |c_#StackHeapBarrier|)))))))) (not (< v_subst_6 |c_#StackHeapBarrier|)))))) (not (< v_subst_8 |c_#StackHeapBarrier|)))) (not (< v_subst_9 |c_#StackHeapBarrier|))))))) is different from false [2022-10-03 12:06:53,430 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_main_~#t1~0#1.offset|) (forall ((|ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (forall ((v_ArrVal_266 Int) (v_subst_9 Int)) (or (forall ((v_ArrVal_267 Int) (v_subst_8 Int)) (or (not (< v_subst_8 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_268 Int) (v_subst_7 Int)) (or (not (< v_subst_7 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_269 Int) (v_subst_6 Int)) (or (not (< v_subst_6 |c_#StackHeapBarrier|)) (forall ((v_subst_5 Int) (v_ArrVal_270 Int)) (or (forall ((v_ArrVal_271 Int) (v_subst_4 Int)) (or (not (< v_subst_4 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_272 Int) (v_subst_3 Int)) (or (not (< v_subst_3 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_273 Int) (v_subst_2 Int)) (or (forall ((v_ArrVal_274 Int) (v_subst_1 Int)) (or (forall ((v_ArrVal_275 Int)) (< (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) (select (store (store (store (store (store (store (store (store (store (store |c_#length| |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_266) v_subst_9 v_ArrVal_267) v_subst_8 v_ArrVal_268) v_subst_7 v_ArrVal_269) v_subst_6 v_ArrVal_270) v_subst_5 v_ArrVal_271) v_subst_4 v_ArrVal_272) v_subst_3 v_ArrVal_273) v_subst_2 v_ArrVal_274) v_subst_1 v_ArrVal_275) |c_ULTIMATE.start_main_~#t1~0#1.base|))) (not (< v_subst_1 |c_#StackHeapBarrier|)))) (not (< v_subst_2 |c_#StackHeapBarrier|)))))))) (not (< v_subst_5 |c_#StackHeapBarrier|)))))))))) (not (< v_subst_9 |c_#StackHeapBarrier|)))) (not (< |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|))))) is different from false [2022-10-03 12:06:56,117 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| Int)) (or (not (< |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_266 Int) (v_subst_9 Int)) (or (forall ((v_ArrVal_267 Int) (v_subst_8 Int)) (or (not (< v_subst_8 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_268 Int) (v_subst_7 Int)) (or (forall ((v_ArrVal_269 Int) (v_subst_6 Int)) (or (not (< v_subst_6 |c_#StackHeapBarrier|)) (forall ((v_subst_5 Int) (v_ArrVal_270 Int)) (or (not (< v_subst_5 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_271 Int) (v_subst_4 Int)) (or (not (< v_subst_4 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_272 Int) (v_subst_3 Int)) (or (not (< v_subst_3 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_273 Int) (v_subst_2 Int)) (or (not (< v_subst_2 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_274 Int) (v_subst_1 Int)) (or (forall ((v_ArrVal_275 Int)) (< (+ 3 |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.offset|) (select (store (store (store (store (store (store (store (store (store (store |c_#length| |ULTIMATE.start_#Ultimate.allocOnHeap_#res#1.base| v_ArrVal_266) v_subst_9 v_ArrVal_267) v_subst_8 v_ArrVal_268) v_subst_7 v_ArrVal_269) v_subst_6 v_ArrVal_270) v_subst_5 v_ArrVal_271) v_subst_4 v_ArrVal_272) v_subst_3 v_ArrVal_273) v_subst_2 v_ArrVal_274) v_subst_1 v_ArrVal_275) |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|))) (not (< v_subst_1 |c_#StackHeapBarrier|)))))))))))))) (not (< v_subst_7 |c_#StackHeapBarrier|)))))) (not (< v_subst_9 |c_#StackHeapBarrier|)))))) (<= 0 |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.offset|)) is different from false Received shutdown request... [2022-10-03 12:18:28,504 WARN L249 SmtUtils]: Removed 1 from assertion stack [2022-10-03 12:18:28,506 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-03 12:18:28,527 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-10-03 12:18:28,527 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-10-03 12:18:28,527 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 12:18:28,528 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-10-03 12:18:28,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 12:18:28,721 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 258 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. [2022-10-03 12:18:28,724 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1] [2022-10-03 12:18:28,725 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT was TIMEOUT (1/2) [2022-10-03 12:18:28,727 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-03 12:18:28,727 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-03 12:18:28,731 INFO L202 PluginConnector]: Adding new model 04-mutex_44-malloc_sound.line361.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 12:18:28 BasicIcfg [2022-10-03 12:18:28,732 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-03 12:18:28,732 INFO L158 Benchmark]: Toolchain (without parser) took 892282.84ms. Allocated memory was 177.2MB in the beginning and 716.2MB in the end (delta: 539.0MB). Free memory was 133.9MB in the beginning and 427.7MB in the end (delta: -293.9MB). Peak memory consumption was 417.7MB. Max. memory is 8.0GB. [2022-10-03 12:18:28,732 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.14ms. Allocated memory is still 177.2MB. Free memory is still 135.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-03 12:18:28,732 INFO L158 Benchmark]: Boogie Preprocessor took 56.67ms. Allocated memory is still 177.2MB. Free memory was 133.9MB in the beginning and 131.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-03 12:18:28,733 INFO L158 Benchmark]: RCFGBuilder took 450.87ms. Allocated memory is still 177.2MB. Free memory was 131.7MB in the beginning and 150.4MB in the end (delta: -18.8MB). Peak memory consumption was 17.9MB. Max. memory is 8.0GB. [2022-10-03 12:18:28,733 INFO L158 Benchmark]: TraceAbstraction took 891771.76ms. Allocated memory was 177.2MB in the beginning and 716.2MB in the end (delta: 539.0MB). Free memory was 149.9MB in the beginning and 427.7MB in the end (delta: -277.9MB). Peak memory consumption was 433.3MB. Max. memory is 8.0GB. [2022-10-03 12:18:28,734 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.14ms. Allocated memory is still 177.2MB. Free memory is still 135.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 56.67ms. Allocated memory is still 177.2MB. Free memory was 133.9MB in the beginning and 131.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 450.87ms. Allocated memory is still 177.2MB. Free memory was 131.7MB in the beginning and 150.4MB in the end (delta: -18.8MB). Peak memory consumption was 17.9MB. Max. memory is 8.0GB. * TraceAbstraction took 891771.76ms. Allocated memory was 177.2MB in the beginning and 716.2MB in the end (delta: 539.0MB). Free memory was 149.9MB in the beginning and 427.7MB in the end (delta: -277.9MB). Peak memory consumption was 433.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: 3, positive: 0, positive conditional: 0, 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: 172, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 172, negative conditional: 172, 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: 3, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, 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: 172, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 172, negative conditional: 172, 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: 6, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 8, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 172, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 172, negative conditional: 172, 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: 14, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 19, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 172, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 172, negative conditional: 172, 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: 33, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 38, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 38, negative conditional: 38, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 172, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 172, negative conditional: 172, 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: 71, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 48, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 48, negative conditional: 48, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 172, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 172, negative conditional: 172, 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: 119, Statistics for Abstraction: - StatisticsResult: Independence relation #7 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 53, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 53, negative conditional: 53, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 172, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 172, negative conditional: 172, 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: 172, Statistics for Abstraction: - TimeoutResultAtElement [Line: 361]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PartialOrderCegarLoop was analyzing trace of length 258 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT with 1 thread instances CFG has 3 procedures, 133 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 891.6s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.6s, 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: 60, 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.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1238 NumberOfCodeBlocks, 1238 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1808 ConstructedInterpolants, 0 QuantifiedInterpolants, 2922 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1116 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 3600/4020 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