/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/divinefifo_1w1r.line1548.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-03 15:38:28,720 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-03 15:38:28,721 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-03 15:38:28,749 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-03 15:38:28,749 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-03 15:38:28,750 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-03 15:38:28,752 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-03 15:38:28,753 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-03 15:38:28,757 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-03 15:38:28,763 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-03 15:38:28,764 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-03 15:38:28,767 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-03 15:38:28,767 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-03 15:38:28,769 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-03 15:38:28,770 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-03 15:38:28,772 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-03 15:38:28,773 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-03 15:38:28,773 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-03 15:38:28,779 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-03 15:38:28,781 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-03 15:38:28,782 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-03 15:38:28,784 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-03 15:38:28,786 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-03 15:38:28,787 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-03 15:38:28,793 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-03 15:38:28,793 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-03 15:38:28,793 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-03 15:38:28,794 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-03 15:38:28,795 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-03 15:38:28,795 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-03 15:38:28,796 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-03 15:38:28,797 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-03 15:38:28,798 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-03 15:38:28,799 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-03 15:38:28,800 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-03 15:38:28,800 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-03 15:38:28,801 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-03 15:38:28,801 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-03 15:38:28,801 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-03 15:38:28,802 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-03 15:38:28,802 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-03 15:38:28,803 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-10-03 15:38:28,840 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-03 15:38:28,840 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-03 15:38:28,841 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-03 15:38:28,841 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-03 15:38:28,842 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-03 15:38:28,842 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-03 15:38:28,843 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-03 15:38:28,843 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-03 15:38:28,843 INFO L138 SettingsManager]: * Use SBE=true [2022-10-03 15:38:28,843 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-03 15:38:28,844 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-03 15:38:28,844 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-03 15:38:28,844 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-03 15:38:28,844 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-03 15:38:28,844 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-03 15:38:28,844 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-03 15:38:28,844 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-03 15:38:28,845 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-03 15:38:28,845 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-03 15:38:28,845 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-03 15:38:28,845 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-03 15:38:28,845 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-03 15:38:28,845 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-03 15:38:28,846 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-03 15:38:28,847 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-03 15:38:28,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 15:38:28,847 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-03 15:38:28,847 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-03 15:38:28,847 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-03 15:38:28,847 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-03 15:38:28,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-03 15:38:28,847 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-03 15:38:28,848 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-03 15:38:28,848 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-03 15:38:28,848 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-03 15:38:28,848 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-03 15:38:28,848 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-03 15:38:28,848 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-03 15:38:28,848 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 15:38:29,083 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-03 15:38:29,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-03 15:38:29,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-03 15:38:29,116 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-03 15:38:29,117 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-03 15:38:29,119 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo_1w1r.line1548.bpl [2022-10-03 15:38:29,119 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo_1w1r.line1548.bpl' [2022-10-03 15:38:29,203 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-03 15:38:29,205 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-03 15:38:29,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-03 15:38:29,207 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-03 15:38:29,207 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-03 15:38:29,221 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divinefifo_1w1r.line1548.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:38:29" (1/1) ... [2022-10-03 15:38:29,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divinefifo_1w1r.line1548.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:38:29" (1/1) ... [2022-10-03 15:38:29,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divinefifo_1w1r.line1548.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:38:29" (1/1) ... [2022-10-03 15:38:29,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divinefifo_1w1r.line1548.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:38:29" (1/1) ... [2022-10-03 15:38:29,331 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divinefifo_1w1r.line1548.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:38:29" (1/1) ... [2022-10-03 15:38:29,337 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divinefifo_1w1r.line1548.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:38:29" (1/1) ... [2022-10-03 15:38:29,343 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divinefifo_1w1r.line1548.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:38:29" (1/1) ... [2022-10-03 15:38:29,355 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-03 15:38:29,357 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-03 15:38:29,357 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-03 15:38:29,357 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-03 15:38:29,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divinefifo_1w1r.line1548.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:38:29" (1/1) ... [2022-10-03 15:38:29,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 15:38:29,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:38:29,425 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 15:38:29,434 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 15:38:29,467 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2022-10-03 15:38:29,467 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2022-10-03 15:38:29,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-03 15:38:29,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-03 15:38:29,469 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 15:38:29,696 INFO L234 CfgBuilder]: Building ICFG [2022-10-03 15:38:29,697 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-03 15:38:30,775 INFO L275 CfgBuilder]: Performing block encoding [2022-10-03 15:38:30,821 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-03 15:38:30,821 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-10-03 15:38:30,826 INFO L202 PluginConnector]: Adding new model divinefifo_1w1r.line1548.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:38:30 BoogieIcfgContainer [2022-10-03 15:38:30,826 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-03 15:38:30,829 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-03 15:38:30,829 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-03 15:38:30,834 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-03 15:38:30,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo_1w1r.line1548.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:38:29" (1/2) ... [2022-10-03 15:38:30,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65c19a4c and model type divinefifo_1w1r.line1548.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 03:38:30, skipping insertion in model container [2022-10-03 15:38:30,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo_1w1r.line1548.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:38:30" (2/2) ... [2022-10-03 15:38:30,843 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo_1w1r.line1548.bpl [2022-10-03 15:38:30,851 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-03 15:38:30,862 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-03 15:38:30,863 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-03 15:38:30,863 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-03 15:38:31,049 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-10-03 15:38:31,130 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 15:38:31,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 15:38:31,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:38:31,136 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 15:38:31,138 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 15:38:31,169 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 15:38:31,176 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONASSERT ======== [2022-10-03 15:38:31,183 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;@6387704a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 15:38:31,183 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 15:38:31,681 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:38:31,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:38:31,688 INFO L85 PathProgramCache]: Analyzing trace with hash 926481793, now seen corresponding path program 1 times [2022-10-03 15:38:31,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:38:31,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301519300] [2022-10-03 15:38:31,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:38:31,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:38:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:38:32,281 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 15:38:32,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:38:32,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301519300] [2022-10-03 15:38:32,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301519300] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:38:32,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:38:32,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-03 15:38:32,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002664131] [2022-10-03 15:38:32,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:38:32,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-03 15:38:32,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:38:32,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-03 15:38:32,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-03 15:38:32,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:38:32,323 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:38:32,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 350.0) internal successors, (700), 2 states have internal predecessors, (700), 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 15:38:32,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:38:32,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:38:32,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-03 15:38:32,550 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:38:32,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:38:32,554 INFO L85 PathProgramCache]: Analyzing trace with hash -668151790, now seen corresponding path program 1 times [2022-10-03 15:38:32,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:38:32,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560681280] [2022-10-03 15:38:32,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:38:32,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:38:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:38:37,063 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 15:38:37,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:38:37,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560681280] [2022-10-03 15:38:37,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560681280] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:38:37,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:38:37,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [68] imperfect sequences [] total 68 [2022-10-03 15:38:37,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202990089] [2022-10-03 15:38:37,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:38:37,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-10-03 15:38:37,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:38:37,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-10-03 15:38:37,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=4340, Unknown=0, NotChecked=0, Total=4556 [2022-10-03 15:38:37,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:38:37,073 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:38:37,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 11.25) internal successors, (765), 68 states have internal predecessors, (765), 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 15:38:37,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:38:37,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:38:57,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:38:57,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-10-03 15:38:57,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-03 15:38:57,251 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:38:57,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:38:57,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1028222114, now seen corresponding path program 1 times [2022-10-03 15:38:57,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:38:57,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284272244] [2022-10-03 15:38:57,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:38:57,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:38:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:38:59,819 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 15:38:59,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:38:59,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284272244] [2022-10-03 15:38:59,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284272244] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:38:59,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:38:59,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-10-03 15:38:59,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208770604] [2022-10-03 15:38:59,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:38:59,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-10-03 15:38:59,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:38:59,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-10-03 15:38:59,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=3592, Unknown=0, NotChecked=0, Total=3782 [2022-10-03 15:38:59,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:38:59,825 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:38:59,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 13.03225806451613) internal successors, (808), 62 states have internal predecessors, (808), 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 15:38:59,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:38:59,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 104 states. [2022-10-03 15:38:59,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:39:15,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:39:15,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-10-03 15:39:15,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-10-03 15:39:15,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-03 15:39:15,299 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:39:15,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:39:15,300 INFO L85 PathProgramCache]: Analyzing trace with hash 215206319, now seen corresponding path program 1 times [2022-10-03 15:39:15,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:39:15,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142886648] [2022-10-03 15:39:15,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:39:15,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:39:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:39:18,502 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 15:39:18,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:39:18,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142886648] [2022-10-03 15:39:18,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142886648] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:39:18,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:39:18,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [75] imperfect sequences [] total 75 [2022-10-03 15:39:18,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918094881] [2022-10-03 15:39:18,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:39:18,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-10-03 15:39:18,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:39:18,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-10-03 15:39:18,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=5310, Unknown=0, NotChecked=0, Total=5550 [2022-10-03 15:39:18,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:39:18,508 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:39:18,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 9.44) internal successors, (708), 75 states have internal predecessors, (708), 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 15:39:18,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:39:18,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 107 states. [2022-10-03 15:39:18,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 98 states. [2022-10-03 15:39:18,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:39:38,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:39:38,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-10-03 15:39:38,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-10-03 15:39:38,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2022-10-03 15:39:38,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-03 15:39:39,000 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:39:39,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:39:39,000 INFO L85 PathProgramCache]: Analyzing trace with hash -408531575, now seen corresponding path program 1 times [2022-10-03 15:39:39,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:39:39,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671542210] [2022-10-03 15:39:39,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:39:39,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:39:39,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:39:42,116 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 15:39:42,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:39:42,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671542210] [2022-10-03 15:39:42,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671542210] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:39:42,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:39:42,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [72] imperfect sequences [] total 72 [2022-10-03 15:39:42,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032166457] [2022-10-03 15:39:42,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:39:42,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-10-03 15:39:42,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:39:42,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-10-03 15:39:42,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=5021, Unknown=0, NotChecked=0, Total=5256 [2022-10-03 15:39:42,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:39:42,122 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:39:42,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 72 states have (on average 8.777777777777779) internal successors, (632), 73 states have internal predecessors, (632), 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 15:39:42,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:39:42,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 107 states. [2022-10-03 15:39:42,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 98 states. [2022-10-03 15:39:42,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 119 states. [2022-10-03 15:39:42,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:40:05,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:40:05,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-10-03 15:40:05,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-10-03 15:40:05,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-10-03 15:40:05,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-10-03 15:40:05,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-03 15:40:05,050 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:40:05,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:40:05,051 INFO L85 PathProgramCache]: Analyzing trace with hash 122435732, now seen corresponding path program 1 times [2022-10-03 15:40:05,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:40:05,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045762557] [2022-10-03 15:40:05,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:40:05,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:40:05,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:40:08,624 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-03 15:40:08,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:40:08,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045762557] [2022-10-03 15:40:08,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045762557] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:40:08,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:40:08,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [82] imperfect sequences [] total 82 [2022-10-03 15:40:08,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732019715] [2022-10-03 15:40:08,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:40:08,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-10-03 15:40:08,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:40:08,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-10-03 15:40:08,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=6374, Unknown=0, NotChecked=0, Total=6642 [2022-10-03 15:40:08,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:40:08,630 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:40:08,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 10.865853658536585) internal successors, (891), 82 states have internal predecessors, (891), 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 15:40:08,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:40:08,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 107 states. [2022-10-03 15:40:08,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 98 states. [2022-10-03 15:40:08,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 121 states. [2022-10-03 15:40:08,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 112 states. [2022-10-03 15:40:08,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:40:39,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:40:39,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-10-03 15:40:39,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-10-03 15:40:39,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2022-10-03 15:40:39,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-10-03 15:40:39,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2022-10-03 15:40:39,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-03 15:40:39,874 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:40:39,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:40:39,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1844762686, now seen corresponding path program 1 times [2022-10-03 15:40:39,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:40:39,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046997675] [2022-10-03 15:40:39,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:40:39,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:40:40,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:40:44,288 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 182 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 15:40:44,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:40:44,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046997675] [2022-10-03 15:40:44,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046997675] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:40:44,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128035873] [2022-10-03 15:40:44,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:40:44,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:40:44,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:40:44,292 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 15:40:44,293 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 15:40:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:40:44,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 2783 conjuncts, 344 conjunts are in the unsatisfiable core [2022-10-03 15:40:44,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:40:45,684 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 15:40:46,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-03 15:40:46,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-03 15:40:47,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:40:47,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-03 15:40:47,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:40:47,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-03 15:40:47,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:40:47,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-10-03 15:40:47,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:40:47,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-03 15:40:51,035 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-03 15:40:51,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-03 15:40:51,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:40:51,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-03 15:40:52,045 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-10-03 15:40:52,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 65 [2022-10-03 15:40:52,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:40:52,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:40:52,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-10-03 15:41:00,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:41:00,152 INFO L356 Elim1Store]: treesize reduction 68, result has 50.7 percent of original size [2022-10-03 15:41:00,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 57 treesize of output 101 [2022-10-03 15:41:00,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:41:00,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:41:00,195 INFO L356 Elim1Store]: treesize reduction 116, result has 17.1 percent of original size [2022-10-03 15:41:00,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 97 treesize of output 77 [2022-10-03 15:41:13,661 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 15:41:13,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-10-03 15:41:15,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:41:15,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:41:15,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:41:15,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:41:15,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:41:15,272 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 15:41:15,279 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-10-03 15:41:15,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 131 treesize of output 110 [2022-10-03 15:41:15,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:41:15,336 INFO L356 Elim1Store]: treesize reduction 100, result has 35.5 percent of original size [2022-10-03 15:41:15,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 85 treesize of output 120 [2022-10-03 15:41:19,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:41:19,509 INFO L356 Elim1Store]: treesize reduction 24, result has 86.7 percent of original size [2022-10-03 15:41:19,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 17 case distinctions, treesize of input 133 treesize of output 249 [2022-10-03 15:44:51,577 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 12 treesize of output 11 [2022-10-03 15:44:55,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:44:55,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:44:55,469 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 15:44:55,471 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:44:55,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 29 [2022-10-03 15:44:55,915 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 96 proven. 268 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 15:44:55,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 15:44:58,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2022-10-03 15:45:43,916 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_read~$Pointer$_#ptr#1.base| Int) (v_ArrVal_506 (Array Int Int)) (|ULTIMATE.start_read~$Pointer$_#value#1.base| Int) (v_ArrVal_507 (Array Int Int)) (v_ArrVal_509 Int) (|ULTIMATE.start_read~$Pointer$_#ptr#1.offset| Int) (v_ArrVal_505 Int)) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_507))) (let ((.cse8 (select (select .cse7 |ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (let ((.cse6 (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_506))) (store .cse9 |ULTIMATE.start_read~$Pointer$_#value#1.base| (let ((.cse10 (select .cse9 |ULTIMATE.start_read~$Pointer$_#value#1.base|))) (store .cse10 .cse8 (select .cse10 .cse8)))))) (.cse4 (store .cse7 |ULTIMATE.start_read~$Pointer$_#value#1.base| (store (select .cse7 |ULTIMATE.start_read~$Pointer$_#value#1.base|) .cse8 v_ArrVal_509)))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse1 (select .cse6 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse3 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse5 (+ 16 .cse0))) (let ((.cse2 (select (select .cse6 .cse3) .cse5))) (or (< .cse0 0) (not (= (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse2)) (< (select (store |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#length#1| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_505) .cse3) (+ 20 .cse0)) (= (select (select .cse4 .cse3) .cse5) 0) (= .cse3 .cse2))))))))) (forall ((|ULTIMATE.start_read~$Pointer$_#ptr#1.base| Int) (v_ArrVal_506 (Array Int Int)) (|ULTIMATE.start_read~$Pointer$_#value#1.base| Int) (v_ArrVal_507 (Array Int Int)) (v_ArrVal_509 Int) (|ULTIMATE.start_read~$Pointer$_#ptr#1.offset| Int) (v_ArrVal_505 Int)) (let ((.cse16 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_507))) (let ((.cse17 (select (select .cse16 |ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (let ((.cse15 (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_506))) (store .cse18 |ULTIMATE.start_read~$Pointer$_#value#1.base| (let ((.cse19 (select .cse18 |ULTIMATE.start_read~$Pointer$_#value#1.base|))) (store .cse19 .cse17 (select .cse19 .cse17))))))) (let ((.cse13 (select .cse15 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse11 (select (select (store .cse16 |ULTIMATE.start_read~$Pointer$_#value#1.base| (store (select .cse16 |ULTIMATE.start_read~$Pointer$_#value#1.base|) .cse17 v_ArrVal_509)) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse12 (select (select .cse15 .cse14) (+ 16 .cse11)))) (or (< .cse11 0) (= .cse12 0) (not (= (select .cse13 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse12)) (< (select (store |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#length#1| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_505) .cse14) (+ 20 .cse11)) (= .cse14 .cse12)))))))))) is different from false [2022-10-03 15:45:43,995 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((|ULTIMATE.start_read~$Pointer$_#ptr#1.base| Int) (v_ArrVal_506 (Array Int Int)) (|ULTIMATE.start_read~$Pointer$_#value#1.base| Int) (v_ArrVal_507 (Array Int Int)) (v_ArrVal_509 Int) (|ULTIMATE.start_read~$Pointer$_#ptr#1.offset| Int) (v_ArrVal_505 Int)) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_507))) (let ((.cse8 (select (select .cse7 |ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (let ((.cse6 (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_506))) (store .cse9 |ULTIMATE.start_read~$Pointer$_#value#1.base| (let ((.cse10 (select .cse9 |ULTIMATE.start_read~$Pointer$_#value#1.base|))) (store .cse10 .cse8 (select .cse10 .cse8)))))) (.cse4 (store .cse7 |ULTIMATE.start_read~$Pointer$_#value#1.base| (store (select .cse7 |ULTIMATE.start_read~$Pointer$_#value#1.base|) .cse8 v_ArrVal_509)))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse1 (select .cse6 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse3 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse5 (+ 16 .cse0))) (let ((.cse2 (select (select .cse6 .cse3) .cse5))) (or (< .cse0 0) (not (= (select .cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse2)) (< (select (store |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#length#1| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_505) .cse3) (+ 20 .cse0)) (= (select (select .cse4 .cse3) .cse5) 0) (= .cse3 .cse2))))))))) (forall ((|ULTIMATE.start_read~$Pointer$_#ptr#1.base| Int) (v_ArrVal_506 (Array Int Int)) (|ULTIMATE.start_read~$Pointer$_#value#1.base| Int) (v_ArrVal_507 (Array Int Int)) (v_ArrVal_509 Int) (|ULTIMATE.start_read~$Pointer$_#ptr#1.offset| Int) (v_ArrVal_505 Int)) (let ((.cse16 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_507))) (let ((.cse17 (select (select .cse16 |ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (let ((.cse15 (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_506))) (store .cse18 |ULTIMATE.start_read~$Pointer$_#value#1.base| (let ((.cse19 (select .cse18 |ULTIMATE.start_read~$Pointer$_#value#1.base|))) (store .cse19 .cse17 (select .cse19 .cse17))))))) (let ((.cse13 (select .cse15 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse11 (select (select (store .cse16 |ULTIMATE.start_read~$Pointer$_#value#1.base| (store (select .cse16 |ULTIMATE.start_read~$Pointer$_#value#1.base|) .cse17 v_ArrVal_509)) |c_ULTIMATE.start_main_~#q~1#1.base|) |c_ULTIMATE.start_main_~#q~1#1.offset|))) (let ((.cse12 (select (select .cse15 .cse14) (+ 16 .cse11)))) (or (< .cse11 0) (= .cse12 0) (not (= (select .cse13 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) .cse12)) (< (select (store |c_ULTIMATE.start_#Ultimate.allocOnStack_old_#length#1| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_505) .cse14) (+ 20 .cse11)) (= .cse14 .cse12)))))))))) (not (< |c_#StackHeapBarrier| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base|))) is different from false [2022-10-03 15:46:19,688 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:46:19,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1974 treesize of output 1992 [2022-10-03 15:46:28,703 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:46:28,704 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 842 treesize of output 746 [2022-10-03 15:46:28,727 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:46:28,728 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 711 treesize of output 649 [2022-10-03 15:46:28,786 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:46:28,786 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 868 treesize of output 775 [2022-10-03 15:46:28,806 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:46:28,807 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 740 treesize of output 669 [2022-10-03 15:46:38,991 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:46:38,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1168 treesize of output 912 [2022-10-03 15:46:39,010 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:46:39,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 867 treesize of output 659 [2022-10-03 15:46:39,349 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 15:46:39,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 582739 treesize of output 570241 [2022-10-03 15:46:41,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:46:41,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:46:41,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:46:45,727 INFO L356 Elim1Store]: treesize reduction 714, result has 31.0 percent of original size [2022-10-03 15:46:45,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 15 select indices, 15 select index equivalence classes, 0 disjoint index pairs (out of 105 index pairs), introduced 16 new quantified variables, introduced 99 case distinctions, treesize of input 707947870 treesize of output 660778575 Received shutdown request... [2022-10-03 15:51:33,707 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 15:51:33,707 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 15:51:33,707 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 15:51:33,738 WARN L249 SmtUtils]: Removed 1 from assertion stack [2022-10-03 15:51:33,744 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-03 15:51:33,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-03 15:51:33,959 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,SelfDestructingSolverStorable6 [2022-10-03 15:51:33,960 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 1144 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-52-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. [2022-10-03 15:51:33,965 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-10-03 15:51:33,967 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT was TIMEOUT (1/2) [2022-10-03 15:51:33,968 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-03 15:51:33,969 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-03 15:51:33,979 INFO L202 PluginConnector]: Adding new model divinefifo_1w1r.line1548.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 03:51:33 BasicIcfg [2022-10-03 15:51:33,979 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-03 15:51:33,980 INFO L158 Benchmark]: Toolchain (without parser) took 784775.22ms. Allocated memory was 199.2MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 148.5MB in the beginning and 628.5MB in the end (delta: -479.9MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-10-03 15:51:33,980 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.16ms. Allocated memory is still 199.2MB. Free memory is still 154.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-03 15:51:33,980 INFO L158 Benchmark]: Boogie Preprocessor took 149.31ms. Allocated memory is still 199.2MB. Free memory was 148.5MB in the beginning and 141.6MB in the end (delta: 6.9MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-10-03 15:51:33,982 INFO L158 Benchmark]: RCFGBuilder took 1469.23ms. Allocated memory was 199.2MB in the beginning and 315.6MB in the end (delta: 116.4MB). Free memory was 141.6MB in the beginning and 265.4MB in the end (delta: -123.8MB). Peak memory consumption was 36.0MB. Max. memory is 8.0GB. [2022-10-03 15:51:33,986 INFO L158 Benchmark]: TraceAbstraction took 783150.61ms. Allocated memory was 315.6MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 264.3MB in the beginning and 628.5MB in the end (delta: -364.2MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-10-03 15:51:33,987 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.16ms. Allocated memory is still 199.2MB. Free memory is still 154.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 149.31ms. Allocated memory is still 199.2MB. Free memory was 148.5MB in the beginning and 141.6MB in the end (delta: 6.9MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 1469.23ms. Allocated memory was 199.2MB in the beginning and 315.6MB in the end (delta: 116.4MB). Free memory was 141.6MB in the beginning and 265.4MB in the end (delta: -123.8MB). Peak memory consumption was 36.0MB. Max. memory is 8.0GB. * TraceAbstraction took 783150.61ms. Allocated memory was 315.6MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 264.3MB in the beginning and 628.5MB in the end (delta: -364.2MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 498, positive: 483, positive conditional: 483, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 14734, positive: 14264, positive conditional: 14264, positive unconditional: 0, negative: 470, negative conditional: 470, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14265, positive: 14264, positive conditional: 0, positive unconditional: 14264, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3028, positive: 3027, positive conditional: 0, positive unconditional: 3027, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 14265, positive: 11237, positive conditional: 0, positive unconditional: 11237, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3028, unknown conditional: 0, unknown unconditional: 3028] , Statistics on independence cache: Total cache size (in pairs): 483, Positive cache size: 483, Positive conditional cache size: 0, Positive unconditional cache size: 483, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 15, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1498, positive: 1455, positive conditional: 1455, positive unconditional: 0, negative: 43, negative conditional: 43, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 14734, positive: 14264, positive conditional: 14264, positive unconditional: 0, negative: 470, negative conditional: 470, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14265, positive: 14264, positive conditional: 0, positive unconditional: 14264, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3028, positive: 3027, positive conditional: 0, positive unconditional: 3027, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 14265, positive: 11237, positive conditional: 0, positive unconditional: 11237, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3028, unknown conditional: 0, unknown unconditional: 3028] , Statistics on independence cache: Total cache size (in pairs): 1457, Positive cache size: 1457, Positive conditional cache size: 0, Positive unconditional cache size: 1457, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 58, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1736, positive: 1680, positive conditional: 1680, positive unconditional: 0, negative: 56, negative conditional: 56, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 14734, positive: 14264, positive conditional: 14264, positive unconditional: 0, negative: 470, negative conditional: 470, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14265, positive: 14264, positive conditional: 0, positive unconditional: 14264, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3028, positive: 3027, positive conditional: 0, positive unconditional: 3027, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 14265, positive: 11237, positive conditional: 0, positive unconditional: 11237, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3028, unknown conditional: 0, unknown unconditional: 3028] , Statistics on independence cache: Total cache size (in pairs): 2190, Positive cache size: 2189, Positive conditional cache size: 0, Positive unconditional cache size: 2189, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Independence queries for same thread: 113, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2124, positive: 2055, positive conditional: 2055, positive unconditional: 0, negative: 69, negative conditional: 69, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 14734, positive: 14264, positive conditional: 14264, positive unconditional: 0, negative: 470, negative conditional: 470, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14265, positive: 14264, positive conditional: 0, positive unconditional: 14264, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3028, positive: 3027, positive conditional: 0, positive unconditional: 3027, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 14265, positive: 11237, positive conditional: 0, positive unconditional: 11237, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3028, unknown conditional: 0, unknown unconditional: 3028] , Statistics on independence cache: Total cache size (in pairs): 2372, Positive cache size: 2371, Positive conditional cache size: 0, Positive unconditional cache size: 2371, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Independence queries for same thread: 182, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1718, positive: 1661, positive conditional: 1661, positive unconditional: 0, negative: 57, negative conditional: 57, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 14734, positive: 14264, positive conditional: 14264, positive unconditional: 0, negative: 470, negative conditional: 470, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14265, positive: 14264, positive conditional: 0, positive unconditional: 14264, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3028, positive: 3027, positive conditional: 0, positive unconditional: 3027, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 14265, positive: 11237, positive conditional: 0, positive unconditional: 11237, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3028, unknown conditional: 0, unknown unconditional: 3028] , Statistics on independence cache: Total cache size (in pairs): 2400, Positive cache size: 2399, Positive conditional cache size: 0, Positive unconditional cache size: 2399, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Independence queries for same thread: 239, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2815, positive: 2725, positive conditional: 2725, positive unconditional: 0, negative: 90, negative conditional: 90, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 14734, positive: 14264, positive conditional: 14264, positive unconditional: 0, negative: 470, negative conditional: 470, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14265, positive: 14264, positive conditional: 0, positive unconditional: 14264, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3028, positive: 3027, positive conditional: 0, positive unconditional: 3027, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 14265, positive: 11237, positive conditional: 0, positive unconditional: 11237, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3028, unknown conditional: 0, unknown unconditional: 3028] , Statistics on independence cache: Total cache size (in pairs): 2796, Positive cache size: 2795, Positive conditional cache size: 0, Positive unconditional cache size: 2795, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Independence queries for same thread: 329, Statistics for Abstraction: - StatisticsResult: Independence relation #7 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 4345, positive: 4205, positive conditional: 4205, positive unconditional: 0, negative: 140, negative conditional: 140, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 14734, positive: 14264, positive conditional: 14264, positive unconditional: 0, negative: 470, negative conditional: 470, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14265, positive: 14264, positive conditional: 0, positive unconditional: 14264, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3028, positive: 3027, positive conditional: 0, positive unconditional: 3027, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 14265, positive: 11237, positive conditional: 0, positive unconditional: 11237, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3028, unknown conditional: 0, unknown unconditional: 3028] , Statistics on independence cache: Total cache size (in pairs): 3028, Positive cache size: 3027, Positive conditional cache size: 0, Positive unconditional cache size: 3027, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Independence queries for same thread: 469, Statistics for Abstraction: - TimeoutResultAtElement [Line: 1548]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PartialOrderCegarLoop was analyzing trace of length 1144 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-52-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-2-2-2-2-2-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, 1438 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 782.8s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 111.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 598, 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.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 16.2s InterpolantComputationTime, 4531 NumberOfCodeBlocks, 4531 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 4525 ConstructedInterpolants, 0 QuantifiedInterpolants, 67509 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 174/174 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