/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/heap-manipulation/bubble_sort_linux-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:47:50,950 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:47:51,021 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 21:47:51,026 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:47:51,027 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:47:51,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:47:51,046 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:47:51,046 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:47:51,047 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:47:51,050 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:47:51,050 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:47:51,050 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:47:51,051 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:47:51,052 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:47:51,052 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:47:51,052 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:47:51,052 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:47:51,052 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:47:51,052 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:47:51,052 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:47:51,053 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:47:51,053 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:47:51,053 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:47:51,053 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:47:51,053 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:47:51,053 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:47:51,054 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:47:51,054 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:47:51,054 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:47:51,054 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:47:51,055 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:47:51,055 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:47:51,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:47:51,055 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:47:51,055 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:47:51,056 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:47:51,056 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:47:51,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:47:51,056 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:47:51,056 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:47:51,056 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:47:51,056 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:47:51,056 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:47:51,056 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 21:47:51,248 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:47:51,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:47:51,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:47:51,276 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:47:51,278 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:47:51,279 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/bubble_sort_linux-2.i [2023-12-15 21:47:52,423 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:47:52,625 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:47:52,625 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/bubble_sort_linux-2.i [2023-12-15 21:47:52,636 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fb5b45b5/d21c0698b7be43af8c764daa733cf12e/FLAGf9ddc57ae [2023-12-15 21:47:52,651 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fb5b45b5/d21c0698b7be43af8c764daa733cf12e [2023-12-15 21:47:52,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:47:52,654 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:47:52,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:47:52,655 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:47:52,658 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:47:52,658 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:47:52" (1/1) ... [2023-12-15 21:47:52,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13d70539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:47:52, skipping insertion in model container [2023-12-15 21:47:52,659 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:47:52" (1/1) ... [2023-12-15 21:47:52,689 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:47:52,933 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2023-12-15 21:47:52,971 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:47:52,988 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:47:53,026 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2023-12-15 21:47:53,037 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:47:53,072 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:47:53,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:47:53 WrapperNode [2023-12-15 21:47:53,072 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:47:53,073 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:47:53,073 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:47:53,073 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:47:53,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:47:53" (1/1) ... [2023-12-15 21:47:53,088 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:47:53" (1/1) ... [2023-12-15 21:47:53,109 INFO L138 Inliner]: procedures = 232, calls = 75, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 118 [2023-12-15 21:47:53,110 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:47:53,110 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:47:53,110 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:47:53,110 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:47:53,118 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:47:53" (1/1) ... [2023-12-15 21:47:53,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:47:53" (1/1) ... [2023-12-15 21:47:53,121 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:47:53" (1/1) ... [2023-12-15 21:47:53,148 INFO L175 MemorySlicer]: Split 37 memory accesses to 2 slices as follows [2, 35]. 95 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 10 writes are split as follows [0, 10]. [2023-12-15 21:47:53,149 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:47:53" (1/1) ... [2023-12-15 21:47:53,149 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:47:53" (1/1) ... [2023-12-15 21:47:53,157 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:47:53" (1/1) ... [2023-12-15 21:47:53,161 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:47:53" (1/1) ... [2023-12-15 21:47:53,163 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:47:53" (1/1) ... [2023-12-15 21:47:53,164 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:47:53" (1/1) ... [2023-12-15 21:47:53,166 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:47:53,167 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:47:53,167 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:47:53,167 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:47:53,168 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:47:53" (1/1) ... [2023-12-15 21:47:53,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:47:53,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:47:53,206 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-15 21:47:53,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-15 21:47:53,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-15 21:47:53,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-15 21:47:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2023-12-15 21:47:53,232 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2023-12-15 21:47:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-15 21:47:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-15 21:47:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-15 21:47:53,233 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2023-12-15 21:47:53,234 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2023-12-15 21:47:53,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-15 21:47:53,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-15 21:47:53,234 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2023-12-15 21:47:53,234 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2023-12-15 21:47:53,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-15 21:47:53,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-15 21:47:53,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-15 21:47:53,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:47:53,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-15 21:47:53,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-15 21:47:53,234 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2023-12-15 21:47:53,234 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2023-12-15 21:47:53,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:47:53,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 21:47:53,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:47:53,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:47:53,332 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:47:53,334 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:47:53,585 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:47:53,617 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:47:53,617 INFO L309 CfgBuilder]: Removed 41 assume(true) statements. [2023-12-15 21:47:53,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:47:53 BoogieIcfgContainer [2023-12-15 21:47:53,618 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:47:53,619 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:47:53,619 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:47:53,621 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:47:53,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:47:52" (1/3) ... [2023-12-15 21:47:53,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af120ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:47:53, skipping insertion in model container [2023-12-15 21:47:53,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:47:53" (2/3) ... [2023-12-15 21:47:53,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af120ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:47:53, skipping insertion in model container [2023-12-15 21:47:53,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:47:53" (3/3) ... [2023-12-15 21:47:53,623 INFO L112 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-2.i [2023-12-15 21:47:53,634 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:47:53,634 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:47:53,666 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:47:53,671 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@19a67467, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:47:53,671 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:47:53,675 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 78 states have (on average 1.8461538461538463) internal successors, (144), 97 states have internal predecessors, (144), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-15 21:47:53,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-15 21:47:53,680 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:47:53,681 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:47:53,681 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:47:53,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:47:53,687 INFO L85 PathProgramCache]: Analyzing trace with hash -754496073, now seen corresponding path program 1 times [2023-12-15 21:47:53,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:47:53,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49196424] [2023-12-15 21:47:53,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:47:53,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:47:53,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:53,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:47:53,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:47:53,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49196424] [2023-12-15 21:47:53,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49196424] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:47:53,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:47:53,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:47:53,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666201335] [2023-12-15 21:47:53,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:47:53,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 21:47:53,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:47:53,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 21:47:53,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:47:53,831 INFO L87 Difference]: Start difference. First operand has 107 states, 78 states have (on average 1.8461538461538463) internal successors, (144), 97 states have internal predecessors, (144), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:47:53,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:47:53,894 INFO L93 Difference]: Finished difference Result 210 states and 377 transitions. [2023-12-15 21:47:53,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 21:47:53,896 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-15 21:47:53,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:47:53,901 INFO L225 Difference]: With dead ends: 210 [2023-12-15 21:47:53,901 INFO L226 Difference]: Without dead ends: 99 [2023-12-15 21:47:53,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:47:53,906 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:47:53,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:47:53,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-12-15 21:47:53,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-12-15 21:47:53,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 89 states have internal predecessors, (94), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-15 21:47:53,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2023-12-15 21:47:53,945 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 8 [2023-12-15 21:47:53,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:47:53,946 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2023-12-15 21:47:53,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:47:53,946 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2023-12-15 21:47:53,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-15 21:47:53,947 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:47:53,948 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:47:53,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:47:53,949 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:47:53,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:47:53,949 INFO L85 PathProgramCache]: Analyzing trace with hash 437181209, now seen corresponding path program 1 times [2023-12-15 21:47:53,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:47:53,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425924589] [2023-12-15 21:47:53,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:47:53,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:47:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:54,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-15 21:47:54,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:54,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:47:54,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:47:54,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425924589] [2023-12-15 21:47:54,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425924589] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:47:54,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:47:54,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:47:54,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182649069] [2023-12-15 21:47:54,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:47:54,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:47:54,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:47:54,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:47:54,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:47:54,203 INFO L87 Difference]: Start difference. First operand 99 states and 120 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-15 21:47:54,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:47:54,496 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2023-12-15 21:47:54,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:47:54,496 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-12-15 21:47:54,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:47:54,498 INFO L225 Difference]: With dead ends: 101 [2023-12-15 21:47:54,498 INFO L226 Difference]: Without dead ends: 98 [2023-12-15 21:47:54,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:47:54,499 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 233 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:47:54,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 87 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:47:54,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-15 21:47:54,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-12-15 21:47:54,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 88 states have internal predecessors, (93), 20 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-15 21:47:54,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2023-12-15 21:47:54,509 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 17 [2023-12-15 21:47:54,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:47:54,510 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2023-12-15 21:47:54,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-15 21:47:54,511 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2023-12-15 21:47:54,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-15 21:47:54,511 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:47:54,511 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:47:54,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:47:54,511 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:47:54,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:47:54,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1443607003, now seen corresponding path program 1 times [2023-12-15 21:47:54,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:47:54,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16557627] [2023-12-15 21:47:54,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:47:54,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:47:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:54,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-15 21:47:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:55,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:47:55,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:47:55,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16557627] [2023-12-15 21:47:55,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16557627] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:47:55,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:47:55,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-15 21:47:55,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007398443] [2023-12-15 21:47:55,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:47:55,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-15 21:47:55,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:47:55,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-15 21:47:55,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-12-15 21:47:55,006 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-15 21:47:55,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:47:55,797 INFO L93 Difference]: Finished difference Result 187 states and 224 transitions. [2023-12-15 21:47:55,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 21:47:55,797 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2023-12-15 21:47:55,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:47:55,799 INFO L225 Difference]: With dead ends: 187 [2023-12-15 21:47:55,799 INFO L226 Difference]: Without dead ends: 181 [2023-12-15 21:47:55,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2023-12-15 21:47:55,801 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 462 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-15 21:47:55,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 122 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-15 21:47:55,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-12-15 21:47:55,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 161. [2023-12-15 21:47:55,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 133 states have (on average 1.263157894736842) internal successors, (168), 147 states have internal predecessors, (168), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-15 21:47:55,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 198 transitions. [2023-12-15 21:47:55,851 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 198 transitions. Word has length 20 [2023-12-15 21:47:55,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:47:55,851 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 198 transitions. [2023-12-15 21:47:55,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-15 21:47:55,851 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 198 transitions. [2023-12-15 21:47:55,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-15 21:47:55,852 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:47:55,852 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:47:55,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 21:47:55,852 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:47:55,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:47:55,852 INFO L85 PathProgramCache]: Analyzing trace with hash 722118342, now seen corresponding path program 1 times [2023-12-15 21:47:55,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:47:55,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621690923] [2023-12-15 21:47:55,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:47:55,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:47:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:56,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-15 21:47:56,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:56,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:47:56,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:47:56,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621690923] [2023-12-15 21:47:56,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621690923] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:47:56,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:47:56,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-15 21:47:56,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521983138] [2023-12-15 21:47:56,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:47:56,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-15 21:47:56,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:47:56,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-15 21:47:56,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2023-12-15 21:47:56,658 INFO L87 Difference]: Start difference. First operand 161 states and 198 transitions. Second operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-15 21:47:57,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:47:57,380 INFO L93 Difference]: Finished difference Result 259 states and 314 transitions. [2023-12-15 21:47:57,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-15 21:47:57,381 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2023-12-15 21:47:57,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:47:57,382 INFO L225 Difference]: With dead ends: 259 [2023-12-15 21:47:57,382 INFO L226 Difference]: Without dead ends: 256 [2023-12-15 21:47:57,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2023-12-15 21:47:57,384 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 305 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-15 21:47:57,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 160 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-15 21:47:57,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2023-12-15 21:47:57,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 238. [2023-12-15 21:47:57,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 203 states have (on average 1.2561576354679802) internal successors, (255), 218 states have internal predecessors, (255), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-15 21:47:57,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 294 transitions. [2023-12-15 21:47:57,414 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 294 transitions. Word has length 23 [2023-12-15 21:47:57,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:47:57,414 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 294 transitions. [2023-12-15 21:47:57,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-15 21:47:57,414 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 294 transitions. [2023-12-15 21:47:57,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-15 21:47:57,415 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:47:57,415 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:47:57,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 21:47:57,415 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:47:57,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:47:57,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1115915285, now seen corresponding path program 1 times [2023-12-15 21:47:57,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:47:57,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940559861] [2023-12-15 21:47:57,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:47:57,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:47:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:57,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-15 21:47:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:57,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:47:57,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:47:57,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940559861] [2023-12-15 21:47:57,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940559861] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:47:57,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:47:57,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-15 21:47:57,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732054634] [2023-12-15 21:47:57,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:47:57,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-15 21:47:57,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:47:57,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-15 21:47:57,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2023-12-15 21:47:57,988 INFO L87 Difference]: Start difference. First operand 238 states and 294 transitions. Second operand has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-15 21:47:58,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:47:58,900 INFO L93 Difference]: Finished difference Result 258 states and 312 transitions. [2023-12-15 21:47:58,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-15 21:47:58,900 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2023-12-15 21:47:58,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:47:58,901 INFO L225 Difference]: With dead ends: 258 [2023-12-15 21:47:58,901 INFO L226 Difference]: Without dead ends: 255 [2023-12-15 21:47:58,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2023-12-15 21:47:58,904 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 344 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-15 21:47:58,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 189 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-15 21:47:58,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2023-12-15 21:47:58,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 238. [2023-12-15 21:47:58,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 203 states have (on average 1.251231527093596) internal successors, (254), 218 states have internal predecessors, (254), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-15 21:47:58,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 293 transitions. [2023-12-15 21:47:58,933 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 293 transitions. Word has length 26 [2023-12-15 21:47:58,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:47:58,934 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 293 transitions. [2023-12-15 21:47:58,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-15 21:47:58,934 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 293 transitions. [2023-12-15 21:47:58,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-15 21:47:58,935 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:47:58,935 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:47:58,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 21:47:58,936 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:47:58,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:47:58,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1422251983, now seen corresponding path program 1 times [2023-12-15 21:47:58,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:47:58,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488493084] [2023-12-15 21:47:58,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:47:58,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:47:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:59,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-15 21:47:59,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:59,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:47:59,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:47:59,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488493084] [2023-12-15 21:47:59,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488493084] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:47:59,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:47:59,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-15 21:47:59,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538503144] [2023-12-15 21:47:59,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:47:59,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-15 21:47:59,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:47:59,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-15 21:47:59,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-12-15 21:47:59,576 INFO L87 Difference]: Start difference. First operand 238 states and 293 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-15 21:48:00,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:48:00,374 INFO L93 Difference]: Finished difference Result 257 states and 310 transitions. [2023-12-15 21:48:00,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-15 21:48:00,375 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2023-12-15 21:48:00,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:48:00,376 INFO L225 Difference]: With dead ends: 257 [2023-12-15 21:48:00,376 INFO L226 Difference]: Without dead ends: 254 [2023-12-15 21:48:00,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2023-12-15 21:48:00,378 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 332 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-15 21:48:00,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 176 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-15 21:48:00,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-12-15 21:48:00,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 238. [2023-12-15 21:48:00,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 203 states have (on average 1.2463054187192117) internal successors, (253), 218 states have internal predecessors, (253), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-15 21:48:00,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 292 transitions. [2023-12-15 21:48:00,403 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 292 transitions. Word has length 29 [2023-12-15 21:48:00,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:48:00,404 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 292 transitions. [2023-12-15 21:48:00,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-15 21:48:00,404 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 292 transitions. [2023-12-15 21:48:00,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-15 21:48:00,404 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:48:00,404 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:48:00,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 21:48:00,405 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:48:00,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:48:00,405 INFO L85 PathProgramCache]: Analyzing trace with hash -678942440, now seen corresponding path program 1 times [2023-12-15 21:48:00,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:48:00,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719561070] [2023-12-15 21:48:00,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:48:00,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:48:00,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:00,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-15 21:48:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:01,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:48:01,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:48:01,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719561070] [2023-12-15 21:48:01,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719561070] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:48:01,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:48:01,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-15 21:48:01,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968639948] [2023-12-15 21:48:01,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:48:01,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-15 21:48:01,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:48:01,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-15 21:48:01,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-12-15 21:48:01,072 INFO L87 Difference]: Start difference. First operand 238 states and 292 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-15 21:48:01,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:48:01,834 INFO L93 Difference]: Finished difference Result 256 states and 308 transitions. [2023-12-15 21:48:01,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-15 21:48:01,834 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2023-12-15 21:48:01,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:48:01,836 INFO L225 Difference]: With dead ends: 256 [2023-12-15 21:48:01,836 INFO L226 Difference]: Without dead ends: 253 [2023-12-15 21:48:01,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2023-12-15 21:48:01,839 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 325 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-15 21:48:01,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 173 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-15 21:48:01,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2023-12-15 21:48:01,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 238. [2023-12-15 21:48:01,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 203 states have (on average 1.2413793103448276) internal successors, (252), 218 states have internal predecessors, (252), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-15 21:48:01,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 291 transitions. [2023-12-15 21:48:01,862 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 291 transitions. Word has length 32 [2023-12-15 21:48:01,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:48:01,863 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 291 transitions. [2023-12-15 21:48:01,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-15 21:48:01,863 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 291 transitions. [2023-12-15 21:48:01,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-15 21:48:01,868 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:48:01,868 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:48:01,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 21:48:01,869 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:48:01,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:48:01,869 INFO L85 PathProgramCache]: Analyzing trace with hash -58033664, now seen corresponding path program 1 times [2023-12-15 21:48:01,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:48:01,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840067861] [2023-12-15 21:48:01,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:48:01,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:48:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:02,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-15 21:48:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:02,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:48:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:02,620 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-15 21:48:02,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:48:02,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840067861] [2023-12-15 21:48:02,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840067861] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:48:02,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85588128] [2023-12-15 21:48:02,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:48:02,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:48:02,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:48:02,624 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:48:02,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-15 21:48:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:02,769 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 92 conjunts are in the unsatisfiable core [2023-12-15 21:48:02,791 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:48:02,865 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-15 21:48:02,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-12-15 21:48:02,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-15 21:48:02,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-15 21:48:03,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2023-12-15 21:48:03,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:48:03,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2023-12-15 21:48:03,192 INFO L378 Elim1Store]: Elim1 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 21 treesize of output 11 [2023-12-15 21:48:03,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2023-12-15 21:48:03,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:48:03,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 19 [2023-12-15 21:48:03,217 INFO L378 Elim1Store]: Elim1 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 21 treesize of output 11 [2023-12-15 21:48:03,269 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-15 21:48:03,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2023-12-15 21:48:03,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-15 21:48:03,353 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-15 21:48:03,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-15 21:48:03,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-15 21:48:03,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-12-15 21:48:03,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 51 [2023-12-15 21:48:03,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:48:03,498 INFO L349 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-12-15 21:48:03,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 45 [2023-12-15 21:48:03,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-12-15 21:48:03,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2023-12-15 21:48:03,552 INFO L378 Elim1Store]: Elim1 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 16 [2023-12-15 21:48:03,706 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:48:03,706 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:48:03,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85588128] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:48:03,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-15 21:48:03,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2023-12-15 21:48:03,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238972414] [2023-12-15 21:48:03,887 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-15 21:48:03,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-15 21:48:03,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:48:03,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-15 21:48:03,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=751, Unknown=6, NotChecked=0, Total=870 [2023-12-15 21:48:03,888 INFO L87 Difference]: Start difference. First operand 238 states and 291 transitions. Second operand has 27 states, 23 states have (on average 2.130434782608696) internal successors, (49), 17 states have internal predecessors, (49), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-15 21:48:05,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:48:05,395 INFO L93 Difference]: Finished difference Result 258 states and 308 transitions. [2023-12-15 21:48:05,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 21:48:05,396 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 2.130434782608696) internal successors, (49), 17 states have internal predecessors, (49), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2023-12-15 21:48:05,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:48:05,397 INFO L225 Difference]: With dead ends: 258 [2023-12-15 21:48:05,397 INFO L226 Difference]: Without dead ends: 255 [2023-12-15 21:48:05,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=245, Invalid=1304, Unknown=11, NotChecked=0, Total=1560 [2023-12-15 21:48:05,398 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 718 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 169 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 1571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:48:05,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 154 Invalid, 1571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 1400 Invalid, 2 Unknown, 0 Unchecked, 1.0s Time] [2023-12-15 21:48:05,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2023-12-15 21:48:05,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 240. [2023-12-15 21:48:05,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 204 states have (on average 1.2352941176470589) internal successors, (252), 219 states have internal predecessors, (252), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-15 21:48:05,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 291 transitions. [2023-12-15 21:48:05,428 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 291 transitions. Word has length 33 [2023-12-15 21:48:05,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:48:05,428 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 291 transitions. [2023-12-15 21:48:05,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 2.130434782608696) internal successors, (49), 17 states have internal predecessors, (49), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-15 21:48:05,428 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 291 transitions. [2023-12-15 21:48:05,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-15 21:48:05,429 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:48:05,429 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:48:05,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-15 21:48:05,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:48:05,636 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:48:05,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:48:05,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1581408063, now seen corresponding path program 1 times [2023-12-15 21:48:05,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:48:05,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36138194] [2023-12-15 21:48:05,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:48:05,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:48:05,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:05,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-15 21:48:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:06,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:48:06,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:48:06,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36138194] [2023-12-15 21:48:06,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36138194] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:48:06,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:48:06,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-15 21:48:06,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321336659] [2023-12-15 21:48:06,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:48:06,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-15 21:48:06,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:48:06,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-15 21:48:06,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-12-15 21:48:06,052 INFO L87 Difference]: Start difference. First operand 240 states and 291 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-15 21:48:06,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:48:06,801 INFO L93 Difference]: Finished difference Result 257 states and 306 transitions. [2023-12-15 21:48:06,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-15 21:48:06,801 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2023-12-15 21:48:06,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:48:06,802 INFO L225 Difference]: With dead ends: 257 [2023-12-15 21:48:06,802 INFO L226 Difference]: Without dead ends: 254 [2023-12-15 21:48:06,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2023-12-15 21:48:06,803 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 398 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-15 21:48:06,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 163 Invalid, 1026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-15 21:48:06,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-12-15 21:48:06,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 240. [2023-12-15 21:48:06,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 204 states have (on average 1.2303921568627452) internal successors, (251), 219 states have internal predecessors, (251), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-15 21:48:06,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 290 transitions. [2023-12-15 21:48:06,827 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 290 transitions. Word has length 35 [2023-12-15 21:48:06,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:48:06,827 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 290 transitions. [2023-12-15 21:48:06,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-15 21:48:06,827 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 290 transitions. [2023-12-15 21:48:06,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-15 21:48:06,827 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:48:06,827 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:48:06,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 21:48:06,828 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:48:06,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:48:06,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1738679921, now seen corresponding path program 1 times [2023-12-15 21:48:06,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:48:06,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181499685] [2023-12-15 21:48:06,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:48:06,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:48:06,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:07,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-15 21:48:07,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:07,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:48:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:07,773 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-15 21:48:07,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:48:07,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181499685] [2023-12-15 21:48:07,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181499685] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:48:07,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861981164] [2023-12-15 21:48:07,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:48:07,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:48:07,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:48:07,775 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) [2023-12-15 21:48:07,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-15 21:48:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:07,911 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 96 conjunts are in the unsatisfiable core [2023-12-15 21:48:07,916 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:48:07,939 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-15 21:48:07,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-12-15 21:48:07,962 INFO L378 Elim1Store]: Elim1 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 16 [2023-12-15 21:48:08,002 INFO L378 Elim1Store]: Elim1 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 84 [2023-12-15 21:48:08,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:48:08,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 72 [2023-12-15 21:48:08,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 47 [2023-12-15 21:48:08,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-15 21:48:08,025 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-12-15 21:48:08,025 INFO L378 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 88 [2023-12-15 21:48:08,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:48:08,034 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2023-12-15 21:48:08,049 INFO L349 Elim1Store]: treesize reduction 20, result has 54.5 percent of original size [2023-12-15 21:48:08,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 51 [2023-12-15 21:48:08,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 97 [2023-12-15 21:48:08,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:48:08,082 INFO L378 Elim1Store]: Elim1 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 92 treesize of output 90 [2023-12-15 21:48:08,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 66 [2023-12-15 21:48:08,106 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-12-15 21:48:08,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 81 [2023-12-15 21:48:08,108 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:48:08,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2023-12-15 21:48:08,113 INFO L378 Elim1Store]: Elim1 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 16 treesize of output 15 [2023-12-15 21:48:08,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:48:08,120 INFO L378 Elim1Store]: Elim1 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 17 treesize of output 21 [2023-12-15 21:48:08,131 INFO L378 Elim1Store]: Elim1 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 90 [2023-12-15 21:48:08,133 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:48:08,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 78 [2023-12-15 21:48:08,138 INFO L378 Elim1Store]: Elim1 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 63 treesize of output 59 [2023-12-15 21:48:08,144 INFO L378 Elim1Store]: Elim1 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 1 [2023-12-15 21:48:08,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 159 [2023-12-15 21:48:08,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:48:08,369 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:48:08,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 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 57 treesize of output 56 [2023-12-15 21:48:08,426 INFO L349 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2023-12-15 21:48:08,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 34 [2023-12-15 21:48:08,438 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-15 21:48:08,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2023-12-15 21:48:08,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:48:08,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:48:08,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 18 [2023-12-15 21:48:08,672 INFO L378 Elim1Store]: Elim1 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 103 treesize of output 98 [2023-12-15 21:48:08,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:48:08,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 72 [2023-12-15 21:48:08,686 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-15 21:48:08,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 77 [2023-12-15 21:48:08,711 INFO L378 Elim1Store]: Elim1 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 14 treesize of output 18 [2023-12-15 21:48:08,773 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-15 21:48:08,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-15 21:48:08,826 INFO L378 Elim1Store]: Elim1 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 32 treesize of output 25 [2023-12-15 21:48:08,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-12-15 21:48:09,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 172 [2023-12-15 21:48:09,095 INFO L349 Elim1Store]: treesize reduction 120, result has 11.1 percent of original size [2023-12-15 21:48:09,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 158 treesize of output 198 [2023-12-15 21:48:09,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:48:09,132 INFO L349 Elim1Store]: treesize reduction 37, result has 48.6 percent of original size [2023-12-15 21:48:09,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 118 [2023-12-15 21:48:09,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 67 [2023-12-15 21:48:09,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-15 21:48:09,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2023-12-15 21:48:09,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:48:09,959 INFO L349 Elim1Store]: treesize reduction 286, result has 19.4 percent of original size [2023-12-15 21:48:09,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 1054 treesize of output 1005 [2023-12-15 21:48:10,073 INFO L349 Elim1Store]: treesize reduction 34, result has 33.3 percent of original size [2023-12-15 21:48:10,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 343 treesize of output 336 [2023-12-15 21:48:10,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:48:10,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2023-12-15 21:48:10,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 215 treesize of output 179 [2023-12-15 21:48:10,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:48:10,593 INFO L349 Elim1Store]: treesize reduction 286, result has 19.4 percent of original size [2023-12-15 21:48:10,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 1034 treesize of output 985 [2023-12-15 21:48:10,742 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-12-15 21:48:10,742 INFO L378 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 310 treesize of output 296 [2023-12-15 21:48:10,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:48:10,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2023-12-15 21:48:10,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 168 [2023-12-15 21:48:11,073 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_~#gl_list~0.offset| 0) (= 3 |c_~#gl_list~0.base|) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| 3))) (let ((.cse7 (= 3 (select .cse6 4))) (.cse8 (= (select (select |c_#memory_$Pointer$#1.offset| 3) 4) 4)) (.cse13 (select .cse6 0)) (.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (or (and (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_18 Int) (v_prenex_163 Int) (v_DerPreprocessor_10 Int)) (let ((.cse5 (store (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_10 v_DerPreprocessor_19) v_DerPreprocessor_18 v_DerPreprocessor_20) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_21) 3 .cse6))) (let ((.cse1 (select .cse5 v_DerPreprocessor_10)) (.cse0 (+ v_prenex_163 4))) (let ((.cse3 (select (store .cse1 .cse0 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 0))) (let ((.cse2 (select .cse5 .cse3))) (and (= (select (select |c_#memory_$Pointer$#1.offset| v_DerPreprocessor_10) .cse0) 4) (= .cse1 v_DerPreprocessor_19) (= v_DerPreprocessor_20 .cse2) (= (select |c_#memory_$Pointer$#1.base| .cse3) .cse2) (not (= v_DerPreprocessor_10 3)) (= v_DerPreprocessor_18 .cse3) (= .cse4 (select .cse5 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_10)))))))) .cse7) (and .cse8 (exists ((v_arrayElimCell_71 Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_10 Int) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_11) 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13))) (let ((.cse11 (select (select .cse10 3) 0))) (let ((.cse12 (select (store (store (store |c_#memory_$Pointer$#1.base| 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13) |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse4) 3)) (.cse9 (store (store (store |c_#memory_$Pointer$#1.base| .cse11 v_DerPreprocessor_14) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_15) 3 v_DerPreprocessor_16))) (and (= (select .cse9 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse4) (= (select .cse10 .cse11) (store (select |c_#memory_$Pointer$#1.base| .cse11) (+ 4 v_arrayElimCell_71) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= v_DerPreprocessor_16 (store .cse12 0 (select v_DerPreprocessor_16 0))) (= v_DerPreprocessor_11 (select .cse10 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse11) (= (store .cse12 0 .cse13) .cse6) (= v_DerPreprocessor_10 .cse11) (= (select .cse9 .cse11) v_DerPreprocessor_14))))))) (and (exists ((v_arrayElimCell_71 Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_10 Int) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse15 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_11) 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13))) (let ((.cse16 (select (select .cse15 3) 0))) (let ((.cse17 (+ 4 v_arrayElimCell_71)) (.cse18 (select (store (store (store |c_#memory_$Pointer$#1.base| 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13) |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse4) 3)) (.cse14 (store (store (store |c_#memory_$Pointer$#1.base| .cse16 v_DerPreprocessor_14) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_15) 3 v_DerPreprocessor_16))) (and (= (select .cse14 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse4) (= (select .cse15 .cse16) (store (select |c_#memory_$Pointer$#1.base| .cse16) .cse17 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= v_DerPreprocessor_16 (store .cse18 0 (select v_DerPreprocessor_16 0))) (= v_DerPreprocessor_11 (select .cse15 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse16) .cse17) 4) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse16) (= (store .cse18 0 .cse13) .cse6) (= v_DerPreprocessor_10 .cse16) (= (select .cse14 .cse16) v_DerPreprocessor_14)))))) .cse8) (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_10 Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse19 (select (store (store (store |c_#memory_$Pointer$#1.base| 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13) |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse4) 3))) (and (exists ((v_DerPreprocessor_16 (Array Int Int))) (and (= v_DerPreprocessor_16 (store .cse19 0 (select v_DerPreprocessor_16 0))) (exists ((v_arrayElimCell_71 Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse21 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_11) 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13))) (let ((.cse23 (select .cse21 3))) (let ((.cse22 (select .cse23 0))) (let ((.cse20 (store (store (store |c_#memory_$Pointer$#1.base| .cse22 v_DerPreprocessor_14) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_15) 3 v_DerPreprocessor_16))) (and (= (select .cse20 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse4) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| (select (select .cse21 .cse22) (+ 4 v_arrayElimCell_71))) (= v_DerPreprocessor_11 (select .cse21 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (select .cse23 4) 3) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse22) (= v_DerPreprocessor_10 .cse22) (= (select .cse20 .cse22) v_DerPreprocessor_14))))))))) (= (store .cse19 0 .cse13) .cse6)))) (and (exists ((v_arrayElimCell_71 Int) (v_DerPreprocessor_10 Int) (v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int))) (let ((.cse24 (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_10 v_DerPreprocessor_23) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_24) 3 .cse6)) (.cse25 (+ 4 v_arrayElimCell_71))) (and (= (select .cse24 v_DerPreprocessor_10) (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_10)) (= 4 (select (select |c_#memory_$Pointer$#1.offset| v_DerPreprocessor_10) .cse25)) (not (= v_DerPreprocessor_10 3)) (= (select .cse24 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse4) (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_10)) (not (= .cse25 0))))) .cse7) (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_10 Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse26 (select (store (store (store |c_#memory_$Pointer$#1.base| 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13) |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse4) 3))) (and (exists ((v_DerPreprocessor_16 (Array Int Int))) (and (= v_DerPreprocessor_16 (store .cse26 0 (select v_DerPreprocessor_16 0))) (exists ((v_arrayElimCell_71 Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse28 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_11) 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13))) (let ((.cse30 (select .cse28 3))) (let ((.cse29 (select .cse30 0))) (let ((.cse27 (store (store (store |c_#memory_$Pointer$#1.base| .cse29 v_DerPreprocessor_14) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_15) 3 v_DerPreprocessor_16))) (and (= (select .cse27 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse4) (= (select .cse28 .cse29) (store (select |c_#memory_$Pointer$#1.base| .cse29) (+ 4 v_arrayElimCell_71) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= v_DerPreprocessor_11 (select .cse28 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (select .cse30 4) 3) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse29) (= v_DerPreprocessor_10 .cse29) (= (select .cse27 .cse29) v_DerPreprocessor_14))))))))) (= (store .cse26 0 .cse13) .cse6)))) (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_10 Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse31 (select (store (store (store |c_#memory_$Pointer$#1.base| 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13) |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse4) 3))) (and (exists ((v_DerPreprocessor_16 (Array Int Int))) (and (= v_DerPreprocessor_16 (store .cse31 0 (select v_DerPreprocessor_16 0))) (exists ((v_arrayElimCell_71 Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse33 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_11) 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13))) (let ((.cse36 (select .cse33 3))) (let ((.cse34 (select .cse36 0))) (let ((.cse35 (+ 4 v_arrayElimCell_71)) (.cse32 (store (store (store |c_#memory_$Pointer$#1.base| .cse34 v_DerPreprocessor_14) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_15) 3 v_DerPreprocessor_16))) (and (= (select .cse32 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse4) (= (select .cse33 .cse34) (store (select |c_#memory_$Pointer$#1.base| .cse34) .cse35 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= v_DerPreprocessor_11 (select .cse33 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (select .cse36 4) 3) (= (select (select |c_#memory_$Pointer$#1.offset| .cse34) .cse35) 4) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse34) (= v_DerPreprocessor_10 .cse34) (= (select .cse32 .cse34) v_DerPreprocessor_14))))))))) (= (store .cse31 0 .cse13) .cse6)))) (and .cse8 (or (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_arrayElimCell_71 Int) (v_DerPreprocessor_27 Int) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int)) (v_DerPreprocessor_10 Int)) (let ((.cse41 (store (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_10 v_DerPreprocessor_28) v_DerPreprocessor_27 v_DerPreprocessor_29) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_30) 3 .cse6))) (let ((.cse37 (select .cse41 v_DerPreprocessor_10)) (.cse40 (+ 4 v_arrayElimCell_71))) (let ((.cse39 (select (store .cse37 .cse40 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 0))) (let ((.cse38 (select .cse41 .cse39))) (and (= v_DerPreprocessor_28 .cse37) (= v_DerPreprocessor_29 .cse38) (= v_DerPreprocessor_27 .cse39) (= .cse38 (select |c_#memory_$Pointer$#1.base| .cse39)) (= 4 (select (select |c_#memory_$Pointer$#1.offset| v_DerPreprocessor_10) .cse40)) (not (= v_DerPreprocessor_10 3)) (= (select .cse41 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse4) (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_10)))))))) (exists ((v_DerPreprocessor_32 (Array Int Int)) (v_prenex_165 Int) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_10 Int)) (let ((.cse43 (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_10 v_DerPreprocessor_32) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_33) 3 .cse6)) (.cse42 (+ v_prenex_165 4))) (and (= (select (select |c_#memory_$Pointer$#1.offset| v_DerPreprocessor_10) .cse42) 4) (= .cse4 (select .cse43 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_10) (select .cse43 v_DerPreprocessor_10)) (not (= .cse42 0)) (not (= v_DerPreprocessor_10 3)) (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_10))))))) (and .cse8 (exists ((v_arrayElimCell_71 Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_10 Int) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse45 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_11) 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13))) (let ((.cse46 (select (select .cse45 3) 0))) (let ((.cse47 (select (store (store (store |c_#memory_$Pointer$#1.base| 3 v_DerPreprocessor_12) v_DerPreprocessor_10 v_DerPreprocessor_13) |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse4) 3)) (.cse44 (store (store (store |c_#memory_$Pointer$#1.base| .cse46 v_DerPreprocessor_14) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_15) 3 v_DerPreprocessor_16))) (and (= (select .cse44 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse4) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| (select (select .cse45 .cse46) (+ 4 v_arrayElimCell_71))) (= v_DerPreprocessor_16 (store .cse47 0 (select v_DerPreprocessor_16 0))) (= v_DerPreprocessor_11 (select .cse45 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse46) (= (store .cse47 0 .cse13) .cse6) (= v_DerPreprocessor_10 .cse46) (= (select .cse44 .cse46) v_DerPreprocessor_14)))))))))) (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| 3))) is different from true [2023-12-15 21:48:11,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:48:15,428 INFO L349 Elim1Store]: treesize reduction 3857, result has 13.2 percent of original size [2023-12-15 21:48:15,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 1 disjoint index pairs (out of 276 index pairs), introduced 26 new quantified variables, introduced 297 case distinctions, treesize of input 872873 treesize of output 682291 [2023-12-15 21:48:16,826 INFO L349 Elim1Store]: treesize reduction 184, result has 66.7 percent of original size [2023-12-15 21:48:16,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 44 case distinctions, treesize of input 5397 treesize of output 5730 [2023-12-15 21:48:17,215 INFO L349 Elim1Store]: treesize reduction 55, result has 30.4 percent of original size [2023-12-15 21:48:17,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 5388 treesize of output 5379 [2023-12-15 21:48:17,819 INFO L349 Elim1Store]: treesize reduction 47, result has 33.8 percent of original size [2023-12-15 21:48:17,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 5330 treesize of output 5321 [2023-12-15 21:48:18,942 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-15 21:48:21,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-15 21:48:22,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2023-12-15 21:48:22,725 INFO L378 Elim1Store]: Elim1 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 67 treesize of output 61 [2023-12-15 21:48:22,755 INFO L378 Elim1Store]: Elim1 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 67 treesize of output 61 [2023-12-15 21:48:23,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 272 treesize of output 248 [2023-12-15 21:48:23,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 168 [2023-12-15 21:48:23,059 INFO L378 Elim1Store]: Elim1 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 113 treesize of output 105 [2023-12-15 21:48:23,092 INFO L378 Elim1Store]: Elim1 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 111 treesize of output 87 [2023-12-15 21:48:23,119 INFO L378 Elim1Store]: Elim1 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 109 treesize of output 85 [2023-12-15 21:48:23,147 INFO L378 Elim1Store]: Elim1 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 24 treesize of output 18 [2023-12-15 21:48:23,444 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 17 [2023-12-15 21:48:23,520 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 17 [2023-12-15 21:48:23,581 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 17 [2023-12-15 21:48:23,619 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 17 [2023-12-15 21:48:23,656 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 17 [2023-12-15 21:48:23,738 INFO L378 Elim1Store]: Elim1 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 26 treesize of output 24 [2023-12-15 21:48:23,776 INFO L378 Elim1Store]: Elim1 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 16 [2023-12-15 21:48:23,813 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:48:23,825 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:48:23,843 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:48:23,854 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:48:23,867 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:48:23,878 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:48:23,923 INFO L378 Elim1Store]: Elim1 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 26 treesize of output 24 [2023-12-15 21:48:23,960 INFO L378 Elim1Store]: Elim1 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 16 [2023-12-15 21:48:24,911 INFO L378 Elim1Store]: Elim1 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 24 treesize of output 22 [2023-12-15 21:48:25,050 INFO L378 Elim1Store]: Elim1 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 1 [2023-12-15 21:48:25,055 INFO L378 Elim1Store]: Elim1 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 9 treesize of output 7 [2023-12-15 21:48:25,071 INFO L378 Elim1Store]: Elim1 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 9 treesize of output 7 [2023-12-15 21:48:25,076 INFO L378 Elim1Store]: Elim1 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 9 treesize of output 7 [2023-12-15 21:48:25,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-12-15 21:48:25,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-15 21:48:25,248 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-15 21:48:25,248 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:48:25,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861981164] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:48:25,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-15 21:48:25,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2023-12-15 21:48:25,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797243492] [2023-12-15 21:48:25,534 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-15 21:48:25,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-15 21:48:25,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:48:25,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-15 21:48:25,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=752, Unknown=10, NotChecked=56, Total=930 [2023-12-15 21:48:25,537 INFO L87 Difference]: Start difference. First operand 240 states and 290 transitions. Second operand has 27 states, 23 states have (on average 2.260869565217391) internal successors, (52), 17 states have internal predecessors, (52), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-15 21:48:32,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-15 21:48:33,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:48:33,261 INFO L93 Difference]: Finished difference Result 257 states and 305 transitions. [2023-12-15 21:48:33,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-15 21:48:33,261 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 2.260869565217391) internal successors, (52), 17 states have internal predecessors, (52), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 36 [2023-12-15 21:48:33,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:48:33,262 INFO L225 Difference]: With dead ends: 257 [2023-12-15 21:48:33,262 INFO L226 Difference]: Without dead ends: 254 [2023-12-15 21:48:33,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=227, Invalid=1325, Unknown=12, NotChecked=76, Total=1640 [2023-12-15 21:48:33,263 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 643 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 107 mSolverCounterUnsat, 34 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 1881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1525 IncrementalHoareTripleChecker+Invalid, 34 IncrementalHoareTripleChecker+Unknown, 215 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:48:33,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 208 Invalid, 1881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1525 Invalid, 34 Unknown, 215 Unchecked, 6.2s Time] [2023-12-15 21:48:33,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-12-15 21:48:33,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 240. [2023-12-15 21:48:33,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 204 states have (on average 1.2254901960784315) internal successors, (250), 219 states have internal predecessors, (250), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-15 21:48:33,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 289 transitions. [2023-12-15 21:48:33,301 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 289 transitions. Word has length 36 [2023-12-15 21:48:33,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:48:33,301 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 289 transitions. [2023-12-15 21:48:33,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 2.260869565217391) internal successors, (52), 17 states have internal predecessors, (52), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-15 21:48:33,301 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 289 transitions. [2023-12-15 21:48:33,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-15 21:48:33,302 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:48:33,302 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:48:33,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-15 21:48:33,507 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,SelfDestructingSolverStorable9 [2023-12-15 21:48:33,507 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:48:33,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:48:33,508 INFO L85 PathProgramCache]: Analyzing trace with hash -424121341, now seen corresponding path program 1 times [2023-12-15 21:48:33,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:48:33,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160092054] [2023-12-15 21:48:33,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:48:33,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:48:33,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:34,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-15 21:48:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:34,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:48:34,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:48:34,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160092054] [2023-12-15 21:48:34,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160092054] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:48:34,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:48:34,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-15 21:48:34,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779120823] [2023-12-15 21:48:34,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:48:34,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-15 21:48:34,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:48:34,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-15 21:48:34,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2023-12-15 21:48:34,272 INFO L87 Difference]: Start difference. First operand 240 states and 289 transitions. Second operand has 15 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 11 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-15 21:48:35,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:48:35,474 INFO L93 Difference]: Finished difference Result 256 states and 303 transitions. [2023-12-15 21:48:35,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-15 21:48:35,474 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 11 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2023-12-15 21:48:35,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:48:35,475 INFO L225 Difference]: With dead ends: 256 [2023-12-15 21:48:35,475 INFO L226 Difference]: Without dead ends: 253 [2023-12-15 21:48:35,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2023-12-15 21:48:35,476 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 361 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-15 21:48:35,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 192 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-15 21:48:35,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2023-12-15 21:48:35,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 240. [2023-12-15 21:48:35,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 204 states have (on average 1.2205882352941178) internal successors, (249), 219 states have internal predecessors, (249), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-15 21:48:35,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 288 transitions. [2023-12-15 21:48:35,511 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 288 transitions. Word has length 38 [2023-12-15 21:48:35,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:48:35,511 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 288 transitions. [2023-12-15 21:48:35,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 11 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-15 21:48:35,512 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 288 transitions. [2023-12-15 21:48:35,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-15 21:48:35,512 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:48:35,512 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:48:35,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-15 21:48:35,512 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:48:35,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:48:35,512 INFO L85 PathProgramCache]: Analyzing trace with hash -528930837, now seen corresponding path program 1 times [2023-12-15 21:48:35,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:48:35,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571475704] [2023-12-15 21:48:35,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:48:35,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:48:35,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:36,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-15 21:48:36,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:36,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:48:36,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:36,672 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-15 21:48:36,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:48:36,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571475704] [2023-12-15 21:48:36,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571475704] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:48:36,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972446485] [2023-12-15 21:48:36,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:48:36,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:48:36,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:48:36,674 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) [2023-12-15 21:48:36,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-15 21:48:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:36,851 INFO L262 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 112 conjunts are in the unsatisfiable core [2023-12-15 21:48:36,854 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:48:36,904 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-15 21:48:36,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-15 21:48:36,985 INFO L378 Elim1Store]: Elim1 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 16 [2023-12-15 21:48:36,991 INFO L378 Elim1Store]: Elim1 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 16 [2023-12-15 21:48:37,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 95 [2023-12-15 21:48:37,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 51 [2023-12-15 21:48:37,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:48:37,453 INFO L378 Elim1Store]: Elim1 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 30 treesize of output 15 [2023-12-15 21:48:37,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-12-15 21:48:37,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 70 [2023-12-15 21:48:37,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 61 [2023-12-15 21:48:37,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-12-15 21:48:37,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 37 [2023-12-15 21:48:37,639 INFO L349 Elim1Store]: treesize reduction 46, result has 9.8 percent of original size [2023-12-15 21:48:37,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 173 treesize of output 131 [2023-12-15 21:48:37,647 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-15 21:48:37,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 56 [2023-12-15 21:48:37,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 31 treesize of output 29 [2023-12-15 21:48:37,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2023-12-15 21:48:37,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:48:37,842 INFO L349 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2023-12-15 21:48:37,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 29 [2023-12-15 21:48:37,908 INFO L378 Elim1Store]: Elim1 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 50 treesize of output 37 [2023-12-15 21:48:37,915 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-15 21:48:37,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 35 [2023-12-15 21:48:38,179 INFO L349 Elim1Store]: treesize reduction 112, result has 26.8 percent of original size [2023-12-15 21:48:38,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 266 treesize of output 242 [2023-12-15 21:48:38,262 INFO L349 Elim1Store]: treesize reduction 199, result has 5.2 percent of original size [2023-12-15 21:48:38,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 235 treesize of output 387 [2023-12-15 21:48:38,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:48:38,278 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:48:38,279 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:48:38,294 INFO L349 Elim1Store]: treesize reduction 162, result has 0.6 percent of original size [2023-12-15 21:48:38,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 355 treesize of output 347 [2023-12-15 21:48:38,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:48:38,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:48:38,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 326 treesize of output 353 [2023-12-15 21:48:38,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:48:38,356 INFO L349 Elim1Store]: treesize reduction 34, result has 17.1 percent of original size [2023-12-15 21:48:38,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 133 treesize of output 109 [2023-12-15 21:48:38,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 88 [2023-12-15 21:48:38,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:48:39,151 INFO L349 Elim1Store]: treesize reduction 132, result has 35.6 percent of original size [2023-12-15 21:48:39,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 244 treesize of output 545 [2023-12-15 21:48:39,218 INFO L349 Elim1Store]: treesize reduction 80, result has 30.4 percent of original size [2023-12-15 21:48:39,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 232 treesize of output 229 [2023-12-15 21:48:39,772 INFO L349 Elim1Store]: treesize reduction 166, result has 0.6 percent of original size [2023-12-15 21:48:39,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 515 treesize of output 440 [2023-12-15 21:48:39,876 INFO L378 Elim1Store]: Elim1 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 100 treesize of output 81 [2023-12-15 21:48:39,902 INFO L378 Elim1Store]: Elim1 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 100 treesize of output 81 [2023-12-15 21:48:39,928 INFO L349 Elim1Store]: treesize reduction 43, result has 2.3 percent of original size [2023-12-15 21:48:39,928 INFO L378 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 422 treesize of output 359 [2023-12-15 21:48:39,962 INFO L378 Elim1Store]: Elim1 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 37 treesize of output 26 [2023-12-15 21:48:39,973 INFO L378 Elim1Store]: Elim1 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 37 treesize of output 26 [2023-12-15 21:48:39,993 INFO L378 Elim1Store]: Elim1 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 17 treesize of output 13 [2023-12-15 21:48:40,014 INFO L378 Elim1Store]: Elim1 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 113 treesize of output 99 [2023-12-15 21:48:41,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 254 treesize of output 224 [2023-12-15 21:48:41,048 INFO L378 Elim1Store]: Elim1 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 273 treesize of output 251 [2023-12-15 21:48:41,067 INFO L378 Elim1Store]: Elim1 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 5 treesize of output 3 [2023-12-15 21:48:41,207 INFO L349 Elim1Store]: treesize reduction 56, result has 44.6 percent of original size [2023-12-15 21:48:41,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 92 treesize of output 88 [2023-12-15 21:48:41,303 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:48:41,304 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:48:41,357 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1167 (Array Int Int))) (not (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1168)) (.cse1 (+ |c_~#gl_list~0.offset| 4))) (let ((.cse2 (select (select .cse0 |c_~#gl_list~0.base|) .cse1))) (= (select (select .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1167) |c_~#gl_list~0.base|) .cse1)) .cse2) .cse2))))) is different from false [2023-12-15 21:48:41,459 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1184 Int) (v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1183 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (.cse3 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|) 4))) (let ((.cse1 (store (let ((.cse6 (+ |c_ULTIMATE.start_gl_insert_~node~1#1.offset| 4))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| .cse2 (store (select |c_#memory_$Pointer$#1.offset| .cse2) .cse3 .cse6)))) (store .cse5 |c_~#gl_list~0.base| (store (select (store .cse5 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1183) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| .cse6)))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1168)) (.cse4 (+ |c_~#gl_list~0.offset| 4))) (let ((.cse0 (select (select .cse1 |c_~#gl_list~0.base|) .cse4))) (= .cse0 (select (select .cse1 (select (select (store (store (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1182) |c_~#gl_list~0.base| (store (select (store (store |c_#memory_$Pointer$#1.base| .cse2 (store (select |c_#memory_$Pointer$#1.base| .cse2) .cse3 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1185) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_1184)) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1167) |c_~#gl_list~0.base|) .cse4)) .cse0))))))) is different from false [2023-12-15 21:48:41,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972446485] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:48:41,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-15 21:48:41,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 30 [2023-12-15 21:48:41,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137392623] [2023-12-15 21:48:41,461 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-15 21:48:41,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-15 21:48:41,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:48:41,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-15 21:48:41,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=892, Unknown=2, NotChecked=122, Total=1122 [2023-12-15 21:48:41,463 INFO L87 Difference]: Start difference. First operand 240 states and 288 transitions. Second operand has 31 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 21 states have internal predecessors, (65), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-15 21:48:48,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:48:48,766 INFO L93 Difference]: Finished difference Result 408 states and 481 transitions. [2023-12-15 21:48:48,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-15 21:48:48,766 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 21 states have internal predecessors, (65), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 39 [2023-12-15 21:48:48,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:48:48,768 INFO L225 Difference]: With dead ends: 408 [2023-12-15 21:48:48,768 INFO L226 Difference]: Without dead ends: 402 [2023-12-15 21:48:48,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 688 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=410, Invalid=2565, Unknown=3, NotChecked=214, Total=3192 [2023-12-15 21:48:48,769 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 1372 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 3719 mSolverCounterSat, 180 mSolverCounterUnsat, 53 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1375 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 3952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 3719 IncrementalHoareTripleChecker+Invalid, 53 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:48:48,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1375 Valid, 615 Invalid, 3952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 3719 Invalid, 53 Unknown, 0 Unchecked, 5.1s Time] [2023-12-15 21:48:48,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2023-12-15 21:48:48,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 333. [2023-12-15 21:48:48,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 289 states have (on average 1.207612456747405) internal successors, (349), 304 states have internal predecessors, (349), 33 states have call successors, (33), 13 states have call predecessors, (33), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-15 21:48:48,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 397 transitions. [2023-12-15 21:48:48,853 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 397 transitions. Word has length 39 [2023-12-15 21:48:48,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:48:48,854 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 397 transitions. [2023-12-15 21:48:48,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 21 states have internal predecessors, (65), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-15 21:48:48,855 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 397 transitions. [2023-12-15 21:48:48,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-15 21:48:48,855 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:48:48,855 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:48:48,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-15 21:48:49,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:48:49,060 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:48:49,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:48:49,061 INFO L85 PathProgramCache]: Analyzing trace with hash 616504430, now seen corresponding path program 1 times [2023-12-15 21:48:49,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:48:49,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579250002] [2023-12-15 21:48:49,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:48:49,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:48:49,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:48:49,086 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 21:48:49,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:48:49,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 21:48:49,120 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 21:48:49,121 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 21:48:49,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-15 21:48:49,124 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:48:49,126 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:48:49,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:48:49 BoogieIcfgContainer [2023-12-15 21:48:49,155 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:48:49,158 INFO L158 Benchmark]: Toolchain (without parser) took 56501.70ms. Allocated memory was 210.8MB in the beginning and 952.1MB in the end (delta: 741.3MB). Free memory was 168.0MB in the beginning and 704.6MB in the end (delta: -536.6MB). Peak memory consumption was 205.6MB. Max. memory is 8.0GB. [2023-12-15 21:48:49,158 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 210.8MB. Free memory is still 158.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:48:49,158 INFO L158 Benchmark]: CACSL2BoogieTranslator took 417.97ms. Allocated memory is still 210.8MB. Free memory was 167.7MB in the beginning and 140.1MB in the end (delta: 27.6MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2023-12-15 21:48:49,158 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.61ms. Allocated memory is still 210.8MB. Free memory was 140.1MB in the beginning and 137.6MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 21:48:49,159 INFO L158 Benchmark]: Boogie Preprocessor took 56.28ms. Allocated memory is still 210.8MB. Free memory was 137.6MB in the beginning and 133.1MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-15 21:48:49,159 INFO L158 Benchmark]: RCFGBuilder took 450.57ms. Allocated memory was 210.8MB in the beginning and 308.3MB in the end (delta: 97.5MB). Free memory was 132.8MB in the beginning and 258.3MB in the end (delta: -125.6MB). Peak memory consumption was 17.0MB. Max. memory is 8.0GB. [2023-12-15 21:48:49,162 INFO L158 Benchmark]: TraceAbstraction took 55536.26ms. Allocated memory was 308.3MB in the beginning and 952.1MB in the end (delta: 643.8MB). Free memory was 257.8MB in the beginning and 704.6MB in the end (delta: -446.8MB). Peak memory consumption was 197.0MB. Max. memory is 8.0GB. [2023-12-15 21:48:49,163 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 210.8MB. Free memory is still 158.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 417.97ms. Allocated memory is still 210.8MB. Free memory was 167.7MB in the beginning and 140.1MB in the end (delta: 27.6MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.61ms. Allocated memory is still 210.8MB. Free memory was 140.1MB in the beginning and 137.6MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 56.28ms. Allocated memory is still 210.8MB. Free memory was 137.6MB in the beginning and 133.1MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 450.57ms. Allocated memory was 210.8MB in the beginning and 308.3MB in the end (delta: 97.5MB). Free memory was 132.8MB in the beginning and 258.3MB in the end (delta: -125.6MB). Peak memory consumption was 17.0MB. Max. memory is 8.0GB. * TraceAbstraction took 55536.26ms. Allocated memory was 308.3MB in the beginning and 952.1MB in the end (delta: 643.8MB). Free memory was 257.8MB in the beginning and 704.6MB in the end (delta: -446.8MB). Peak memory consumption was 197.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 840]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L850] struct list_head gl_list = { &(gl_list), &(gl_list) }; [L850] struct list_head gl_list = { &(gl_list), &(gl_list) }; [L850] struct list_head gl_list = { &(gl_list), &(gl_list) }; [L949] CALL gl_read() [L909] CALL gl_insert(__VERIFIER_nondet_int()) [L899] struct node *node = malloc(sizeof *node); [L900] COND FALSE !(!node) VAL [\old(value)=6, gl_list={3:0}, node={5:0}, value=6] [L902] node->value = value VAL [gl_list={3:0}] [L903] CALL list_add(&node->linkage, &gl_list) VAL [gl_list={3:0}] [L890] EXPR head->next [L890] CALL __list_add(new, head, head->next) [L878] next->prev = new [L879] new->next = next [L880] new->prev = prev [L881] prev->next = new [L890] RET __list_add(new, head, head->next) [L903] RET list_add(&node->linkage, &gl_list) VAL [\old(value)=6, gl_list={3:0}, node={5:0}, value=6] [L904] (&node->nested)->next = (&node->nested) [L904] (&node->nested)->next = (&node->nested) VAL [gl_list={3:0}] [L909] RET gl_insert(__VERIFIER_nondet_int()) [L911] COND FALSE !(__VERIFIER_nondet_int()) [L949] RET gl_read() [L950] CALL inspect(&gl_list) VAL [gl_list={3:0}, head={3:0}] [L853] COND FALSE !(!(head)) VAL [gl_list={3:0}, head={3:0}, head={3:0}] [L854] EXPR head->next VAL [gl_list={3:0}, head={3:0}, head={3:0}] [L854] COND FALSE !(!(head->next != head)) [L855] EXPR head->prev VAL [gl_list={3:0}, head={3:0}, head={3:0}] [L855] COND FALSE !(!(head->prev != head)) [L856] EXPR head->prev [L856] head = head->prev [L857] COND FALSE !(!(head)) VAL [gl_list={3:0}, head={3:0}, head={5:4}] [L858] EXPR head->next VAL [gl_list={3:0}, head={3:0}, head={5:4}] [L858] COND FALSE !(!(head->next != head)) [L859] EXPR head->prev VAL [gl_list={3:0}, head={3:0}, head={5:4}] [L859] COND FALSE !(!(head->prev != head)) [L860] const struct node *node = ((struct node *)((char *)(head)-(unsigned long)(&((struct node *)0)->linkage))); VAL [gl_list={3:0}, head={3:0}, head={5:4}, node={5:0}] [L861] COND FALSE !(!(node)) VAL [gl_list={3:0}, head={3:0}, head={5:4}, node={5:0}] [L862] EXPR node->nested.next VAL [gl_list={3:0}, head={3:0}, head={5:4}, node={5:0}] [L862] COND FALSE !(!(node->nested.next == &node->nested)) [L863] EXPR node->nested.prev VAL [gl_list={3:0}, head={3:0}, head={5:4}, node={5:0}] [L863] COND TRUE !(node->nested.prev == &node->nested) [L863] CALL fail() VAL [gl_list={3:0}] [L840] reach_error() VAL [gl_list={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 55.5s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 22.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 89 mSolverCounterUnknown, 5523 SdHoareTripleChecker+Valid, 16.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5493 mSDsluCounter, 2357 SdHoareTripleChecker+Invalid, 15.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 215 IncrementalHoareTripleChecker+Unchecked, 1990 mSDsCounter, 809 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14095 IncrementalHoareTripleChecker+Invalid, 15208 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 809 mSolverCounterUnsat, 367 mSDtfsCounter, 14095 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 420 GetRequests, 146 SyntacticMatches, 1 SemanticMatches, 273 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1652 ImplicationChecksByTransitivity, 8.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=333occurred in iteration=12, InterpolantAutomatonStates: 174, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 211 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 30.4s InterpolantComputationTime, 485 NumberOfCodeBlocks, 485 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 429 ConstructedInterpolants, 33 QuantifiedInterpolants, 17499 SizeOfPredicates, 58 NumberOfNonLiveVariables, 897 ConjunctsInSsa, 300 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 3/60 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 proved your program to be incorrect! [2023-12-15 21:48:49,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...