/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/forester-heap/dll-circular-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:50:30,990 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:50:31,060 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:50:31,063 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:50:31,063 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:50:31,084 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:50:31,085 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:50:31,085 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:50:31,085 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:50:31,088 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:50:31,088 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:50:31,088 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:50:31,089 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:50:31,090 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:50:31,090 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:50:31,090 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:50:31,090 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:50:31,090 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:50:31,090 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:50:31,091 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:50:31,091 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:50:31,091 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:50:31,091 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:50:31,091 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:50:31,091 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:50:31,091 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:50:31,092 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:50:31,092 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:50:31,092 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:50:31,092 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:50:31,093 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:50:31,093 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:50:31,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:50:31,093 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:50:31,093 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:50:31,094 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:50:31,094 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:50:31,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:50:31,094 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:50:31,094 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:50:31,094 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:50:31,094 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:50:31,094 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:50:31,094 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:50:31,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:50:31,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:50:31,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:50:31,296 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:50:31,296 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:50:31,296 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-circular-2.i [2023-12-15 21:50:32,585 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:50:32,793 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:50:32,793 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-circular-2.i [2023-12-15 21:50:32,806 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caa2f7df3/1fdf3dee11264688a74d9564327661b8/FLAGad633dd0a [2023-12-15 21:50:32,818 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caa2f7df3/1fdf3dee11264688a74d9564327661b8 [2023-12-15 21:50:32,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:50:32,821 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:50:32,823 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:50:32,823 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:50:32,826 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:50:32,827 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:50:32" (1/1) ... [2023-12-15 21:50:32,827 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a699375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:32, skipping insertion in model container [2023-12-15 21:50:32,827 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:50:32" (1/1) ... [2023-12-15 21:50:32,866 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:50:33,104 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-circular-2.i[22391,22404] [2023-12-15 21:50:33,109 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-circular-2.i[22497,22510] [2023-12-15 21:50:33,111 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-circular-2.i[22622,22635] [2023-12-15 21:50:33,117 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:50:33,127 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:50:33,165 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-circular-2.i[22391,22404] [2023-12-15 21:50:33,166 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-circular-2.i[22497,22510] [2023-12-15 21:50:33,167 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-circular-2.i[22622,22635] [2023-12-15 21:50:33,168 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:50:33,190 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:50:33,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:33 WrapperNode [2023-12-15 21:50:33,191 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:50:33,192 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:50:33,192 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:50:33,192 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:50:33,197 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:50:33" (1/1) ... [2023-12-15 21:50:33,205 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:50:33" (1/1) ... [2023-12-15 21:50:33,222 INFO L138 Inliner]: procedures = 119, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 118 [2023-12-15 21:50:33,223 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:50:33,223 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:50:33,223 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:50:33,223 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:50:33,231 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:33" (1/1) ... [2023-12-15 21:50:33,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:33" (1/1) ... [2023-12-15 21:50:33,233 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:33" (1/1) ... [2023-12-15 21:50:33,256 INFO L175 MemorySlicer]: Split 23 memory accesses to 2 slices as follows [2, 21]. 91 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 8 writes are split as follows [0, 8]. [2023-12-15 21:50:33,257 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:33" (1/1) ... [2023-12-15 21:50:33,257 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:33" (1/1) ... [2023-12-15 21:50:33,267 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:33" (1/1) ... [2023-12-15 21:50:33,271 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:33" (1/1) ... [2023-12-15 21:50:33,272 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:33" (1/1) ... [2023-12-15 21:50:33,273 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:33" (1/1) ... [2023-12-15 21:50:33,275 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:50:33,275 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:50:33,275 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:50:33,276 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:50:33,276 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:33" (1/1) ... [2023-12-15 21:50:33,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:50:33,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:50:33,320 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:50:33,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-15 21:50:33,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-15 21:50:33,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-15 21:50:33,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-15 21:50:33,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-15 21:50:33,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:50:33,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-15 21:50:33,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-15 21:50:33,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-15 21:50:33,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-15 21:50:33,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-15 21:50:33,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:50:33,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 21:50:33,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:50:33,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:50:33,352 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:50:33,456 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:50:33,458 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:50:33,667 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:50:33,693 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:50:33,693 INFO L309 CfgBuilder]: Removed 9 assume(true) statements. [2023-12-15 21:50:33,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:50:33 BoogieIcfgContainer [2023-12-15 21:50:33,693 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:50:33,695 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:50:33,695 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:50:33,697 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:50:33,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:50:32" (1/3) ... [2023-12-15 21:50:33,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@94fae5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:50:33, skipping insertion in model container [2023-12-15 21:50:33,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:33" (2/3) ... [2023-12-15 21:50:33,698 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@94fae5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:50:33, skipping insertion in model container [2023-12-15 21:50:33,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:50:33" (3/3) ... [2023-12-15 21:50:33,699 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-circular-2.i [2023-12-15 21:50:33,713 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:50:33,713 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-12-15 21:50:33,748 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:50:33,778 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;@142671cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:50:33,778 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-15 21:50:33,789 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 29 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:33,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-15 21:50:33,793 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:33,793 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-15 21:50:33,794 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:50:33,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:33,799 INFO L85 PathProgramCache]: Analyzing trace with hash 149304739, now seen corresponding path program 1 times [2023-12-15 21:50:33,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:33,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366674548] [2023-12-15 21:50:33,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:33,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:33,983 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:50:33,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:33,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366674548] [2023-12-15 21:50:33,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366674548] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:50:33,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:50:33,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:50:33,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695796305] [2023-12-15 21:50:33,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:50:33,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 21:50:33,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:34,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 21:50:34,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:50:34,014 INFO L87 Difference]: Start difference. First operand has 30 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 29 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:34,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:34,038 INFO L93 Difference]: Finished difference Result 59 states and 95 transitions. [2023-12-15 21:50:34,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 21:50:34,040 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-12-15 21:50:34,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:34,045 INFO L225 Difference]: With dead ends: 59 [2023-12-15 21:50:34,045 INFO L226 Difference]: Without dead ends: 25 [2023-12-15 21:50:34,047 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:50:34,051 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:34,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:50:34,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-15 21:50:34,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-12-15 21:50:34,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:34,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2023-12-15 21:50:34,076 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 5 [2023-12-15 21:50:34,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:34,077 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2023-12-15 21:50:34,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:34,077 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2023-12-15 21:50:34,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-15 21:50:34,077 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:34,078 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-15 21:50:34,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:50:34,079 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:50:34,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:34,079 INFO L85 PathProgramCache]: Analyzing trace with hash 292511250, now seen corresponding path program 1 times [2023-12-15 21:50:34,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:34,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225251170] [2023-12-15 21:50:34,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:34,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:34,365 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:50:34,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:34,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225251170] [2023-12-15 21:50:34,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225251170] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:50:34,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:50:34,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:50:34,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124952019] [2023-12-15 21:50:34,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:50:34,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:50:34,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:34,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:50:34,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:50:34,373 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:34,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:34,444 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2023-12-15 21:50:34,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 21:50:34,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-12-15 21:50:34,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:34,446 INFO L225 Difference]: With dead ends: 41 [2023-12-15 21:50:34,446 INFO L226 Difference]: Without dead ends: 37 [2023-12-15 21:50:34,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:50:34,447 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:34,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 43 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:50:34,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-12-15 21:50:34,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2023-12-15 21:50:34,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:34,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2023-12-15 21:50:34,454 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 6 [2023-12-15 21:50:34,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:34,454 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2023-12-15 21:50:34,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:34,454 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2023-12-15 21:50:34,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-15 21:50:34,455 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:34,455 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:50:34,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:50:34,455 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:50:34,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:34,456 INFO L85 PathProgramCache]: Analyzing trace with hash 393679078, now seen corresponding path program 1 times [2023-12-15 21:50:34,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:34,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7095602] [2023-12-15 21:50:34,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:34,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:34,488 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:50:34,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:34,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7095602] [2023-12-15 21:50:34,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7095602] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:50:34,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:50:34,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:50:34,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248618552] [2023-12-15 21:50:34,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:50:34,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:50:34,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:34,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:50:34,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:50:34,490 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:34,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:34,506 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2023-12-15 21:50:34,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:50:34,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-15 21:50:34,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:34,508 INFO L225 Difference]: With dead ends: 70 [2023-12-15 21:50:34,508 INFO L226 Difference]: Without dead ends: 48 [2023-12-15 21:50:34,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:50:34,509 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 20 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:34,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 45 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:50:34,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-15 21:50:34,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2023-12-15 21:50:34,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:34,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2023-12-15 21:50:34,514 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 9 [2023-12-15 21:50:34,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:34,514 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2023-12-15 21:50:34,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:34,515 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2023-12-15 21:50:34,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-15 21:50:34,515 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:34,515 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:50:34,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 21:50:34,515 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:50:34,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:34,516 INFO L85 PathProgramCache]: Analyzing trace with hash -659012930, now seen corresponding path program 1 times [2023-12-15 21:50:34,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:34,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802389458] [2023-12-15 21:50:34,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:34,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:34,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:34,549 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:50:34,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:34,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802389458] [2023-12-15 21:50:34,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802389458] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:50:34,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:50:34,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:50:34,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489302082] [2023-12-15 21:50:34,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:50:34,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:50:34,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:34,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:50:34,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:50:34,551 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:34,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:34,564 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2023-12-15 21:50:34,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:50:34,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-15 21:50:34,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:34,565 INFO L225 Difference]: With dead ends: 37 [2023-12-15 21:50:34,565 INFO L226 Difference]: Without dead ends: 35 [2023-12-15 21:50:34,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:50:34,566 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:34,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:50:34,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-15 21:50:34,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-12-15 21:50:34,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:34,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2023-12-15 21:50:34,635 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 12 [2023-12-15 21:50:34,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:34,635 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2023-12-15 21:50:34,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:34,635 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2023-12-15 21:50:34,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-15 21:50:34,636 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:34,636 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:50:34,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 21:50:34,636 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:50:34,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:34,637 INFO L85 PathProgramCache]: Analyzing trace with hash -659011008, now seen corresponding path program 1 times [2023-12-15 21:50:34,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:34,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953809852] [2023-12-15 21:50:34,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:34,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:34,947 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:50:34,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:34,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953809852] [2023-12-15 21:50:34,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953809852] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:50:34,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:50:34,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:50:34,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324126075] [2023-12-15 21:50:34,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:50:34,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:50:34,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:34,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:50:34,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:50:34,950 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:35,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:35,071 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2023-12-15 21:50:35,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:50:35,072 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-15 21:50:35,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:35,072 INFO L225 Difference]: With dead ends: 46 [2023-12-15 21:50:35,072 INFO L226 Difference]: Without dead ends: 33 [2023-12-15 21:50:35,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:50:35,073 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:35,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 68 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:50:35,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-15 21:50:35,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-12-15 21:50:35,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:35,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2023-12-15 21:50:35,077 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 12 [2023-12-15 21:50:35,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:35,077 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2023-12-15 21:50:35,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:35,077 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2023-12-15 21:50:35,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-15 21:50:35,078 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:35,078 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:50:35,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 21:50:35,078 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:50:35,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:35,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1208969863, now seen corresponding path program 1 times [2023-12-15 21:50:35,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:35,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579126788] [2023-12-15 21:50:35,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:35,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:35,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:50:35,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:35,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579126788] [2023-12-15 21:50:35,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579126788] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:50:35,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398893023] [2023-12-15 21:50:35,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:35,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:50:35,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:50:35,249 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:50:35,284 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:50:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:35,399 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-15 21:50:35,403 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:50:35,443 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 6 treesize of output 5 [2023-12-15 21:50:35,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:50:35,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:50:35,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 36 treesize of output 26 [2023-12-15 21:50:35,502 INFO L349 Elim1Store]: treesize reduction 46, result has 9.8 percent of original size [2023-12-15 21:50:35,502 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 34 [2023-12-15 21:50:35,514 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-15 21:50:35,514 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 1 case distinctions, treesize of input 15 treesize of output 15 [2023-12-15 21:50:35,519 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:50:35,549 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-15 21:50:35,549 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2023-12-15 21:50:35,601 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 47 treesize of output 27 [2023-12-15 21:50:35,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:50:35,604 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:50:35,610 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_234 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_234) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2023-12-15 21:50:35,655 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2023-12-15 21:50:35,655 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 106 treesize of output 113 [2023-12-15 21:50:35,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:35,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 163 treesize of output 167 [2023-12-15 21:50:35,696 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 107 treesize of output 101 [2023-12-15 21:50:35,817 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 6 treesize of output 4 [2023-12-15 21:50:35,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:35,828 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 30 treesize of output 30 [2023-12-15 21:50:35,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-15 21:50:35,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398893023] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:50:35,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:50:35,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2023-12-15 21:50:35,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449691155] [2023-12-15 21:50:35,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:50:35,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 21:50:35,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:35,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 21:50:35,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=39, Unknown=1, NotChecked=12, Total=72 [2023-12-15 21:50:35,896 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:35,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:35,970 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2023-12-15 21:50:35,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:50:35,972 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-15 21:50:35,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:35,975 INFO L225 Difference]: With dead ends: 60 [2023-12-15 21:50:35,975 INFO L226 Difference]: Without dead ends: 58 [2023-12-15 21:50:35,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=49, Unknown=1, NotChecked=14, Total=90 [2023-12-15 21:50:35,976 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 25 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:35,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 86 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 37 Unchecked, 0.0s Time] [2023-12-15 21:50:35,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-12-15 21:50:35,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 47. [2023-12-15 21:50:35,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 46 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:35,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2023-12-15 21:50:35,982 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 12 [2023-12-15 21:50:35,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:35,982 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2023-12-15 21:50:35,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:35,982 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2023-12-15 21:50:35,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-15 21:50:35,983 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:35,983 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:50:36,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-15 21:50:36,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-15 21:50:36,188 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:50:36,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:36,189 INFO L85 PathProgramCache]: Analyzing trace with hash 292973760, now seen corresponding path program 1 times [2023-12-15 21:50:36,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:36,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956980155] [2023-12-15 21:50:36,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:36,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:36,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:50:36,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:36,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956980155] [2023-12-15 21:50:36,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956980155] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:50:36,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:50:36,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:50:36,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613428698] [2023-12-15 21:50:36,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:50:36,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:50:36,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:36,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:50:36,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:50:36,222 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:36,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:36,240 INFO L93 Difference]: Finished difference Result 95 states and 115 transitions. [2023-12-15 21:50:36,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:50:36,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-15 21:50:36,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:36,241 INFO L225 Difference]: With dead ends: 95 [2023-12-15 21:50:36,241 INFO L226 Difference]: Without dead ends: 72 [2023-12-15 21:50:36,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:50:36,242 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 17 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:36,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 67 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:50:36,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-12-15 21:50:36,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55. [2023-12-15 21:50:36,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 54 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:36,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2023-12-15 21:50:36,246 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 16 [2023-12-15 21:50:36,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:36,246 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2023-12-15 21:50:36,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:36,247 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2023-12-15 21:50:36,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-15 21:50:36,247 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:36,247 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:50:36,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 21:50:36,247 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:50:36,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:36,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1890030859, now seen corresponding path program 1 times [2023-12-15 21:50:36,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:36,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104509029] [2023-12-15 21:50:36,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:36,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:36,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:36,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:50:36,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:36,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104509029] [2023-12-15 21:50:36,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104509029] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:50:36,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365487229] [2023-12-15 21:50:36,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:36,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:50:36,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:50:36,692 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:50:36,728 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:50:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:36,823 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 55 conjunts are in the unsatisfiable core [2023-12-15 21:50:36,827 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:50:36,838 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 6 treesize of output 5 [2023-12-15 21:50:36,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-15 21:50:36,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 35 [2023-12-15 21:50:36,949 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-15 21:50:36,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 35 [2023-12-15 21:50:36,972 INFO L349 Elim1Store]: treesize reduction 82, result has 1.2 percent of original size [2023-12-15 21:50:36,973 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 226 treesize of output 204 [2023-12-15 21:50:36,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2023-12-15 21:50:36,988 INFO L349 Elim1Store]: treesize reduction 14, result has 39.1 percent of original size [2023-12-15 21:50:36,989 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 43 [2023-12-15 21:50:36,994 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:50:37,005 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-12-15 21:50:37,006 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 1 case distinctions, treesize of input 19 treesize of output 27 [2023-12-15 21:50:37,037 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-12-15 21:50:37,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 52 [2023-12-15 21:50:37,047 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-15 21:50:37,047 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 26 [2023-12-15 21:50:37,056 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:50:37,071 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-15 21:50:37,071 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:50:37,078 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 35 treesize of output 18 [2023-12-15 21:50:37,081 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 18 treesize of output 11 [2023-12-15 21:50:37,143 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:50:37,153 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 0 case distinctions, treesize of input 30 treesize of output 21 [2023-12-15 21:50:37,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2023-12-15 21:50:37,272 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-15 21:50:37,274 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 112 treesize of output 73 [2023-12-15 21:50:37,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2023-12-15 21:50:37,287 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 20 treesize of output 15 [2023-12-15 21:50:37,432 INFO L349 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2023-12-15 21:50:37,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 64 [2023-12-15 21:50:37,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-12-15 21:50:37,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:50:37,467 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:50:37,497 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_417 (Array Int Int)) (v_ArrVal_418 Int) (v_ArrVal_420 (Array Int Int))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (or (= (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse4 v_ArrVal_418))) (.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_417))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_420) (select (select .cse0 .cse1) .cse2)) (+ 8 (select (select .cse3 .cse1) .cse2))))) 0) (not (= v_ArrVal_417 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse4 (select v_ArrVal_417 .cse4))))))) is different from false [2023-12-15 21:50:37,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:37,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 558 treesize of output 446 [2023-12-15 21:50:37,630 INFO L349 Elim1Store]: treesize reduction 19, result has 69.4 percent of original size [2023-12-15 21:50:37,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 574 treesize of output 446 [2023-12-15 21:50:37,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:37,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 5775 treesize of output 5183 [2023-12-15 21:50:38,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:38,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 1397399 treesize of output 1261429 [2023-12-15 21:50:40,597 INFO L349 Elim1Store]: treesize reduction 596, result has 50.0 percent of original size [2023-12-15 21:50:40,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 31 case distinctions, treesize of input 4257 treesize of output 4449 [2023-12-15 21:50:40,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:40,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 4123 treesize of output 3643 [2023-12-15 21:50:41,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:41,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 6 [2023-12-15 21:50:42,567 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 6 treesize of output 4 Received shutdown request... [2023-12-15 21:51:44,635 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-15 21:51:44,635 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-15 21:51:44,644 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-12-15 21:51:44,652 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:51:44,849 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,SelfDestructingSolverStorable7 [2023-12-15 21:51:44,849 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-6-1 term,while PolyPacSimplificationTermWalker was simplifying 6 xjuncts wrt. a ∧-84-3-6-2-5-2-4-2-3-3-3-2-1 context. [2023-12-15 21:51:44,852 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-12-15 21:51:44,853 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-12-15 21:51:44,855 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:51:44,857 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:51:44,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:51:44 BoogieIcfgContainer [2023-12-15 21:51:44,858 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:51:44,858 INFO L158 Benchmark]: Toolchain (without parser) took 72037.07ms. Allocated memory was 212.9MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 144.1MB in the beginning and 821.2MB in the end (delta: -677.2MB). Peak memory consumption was 711.3MB. Max. memory is 8.0GB. [2023-12-15 21:51:44,858 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 212.9MB. Free memory is still 161.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:51:44,859 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.95ms. Allocated memory is still 212.9MB. Free memory was 144.1MB in the beginning and 125.5MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-15 21:51:44,859 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.06ms. Allocated memory is still 212.9MB. Free memory was 125.5MB in the beginning and 123.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 21:51:44,859 INFO L158 Benchmark]: Boogie Preprocessor took 51.63ms. Allocated memory is still 212.9MB. Free memory was 123.4MB in the beginning and 121.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 21:51:44,859 INFO L158 Benchmark]: RCFGBuilder took 417.89ms. Allocated memory is still 212.9MB. Free memory was 121.0MB in the beginning and 104.8MB in the end (delta: 16.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-15 21:51:44,859 INFO L158 Benchmark]: TraceAbstraction took 71163.33ms. Allocated memory was 212.9MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 103.9MB in the beginning and 821.2MB in the end (delta: -717.3MB). Peak memory consumption was 671.4MB. Max. memory is 8.0GB. [2023-12-15 21:51:44,860 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.10ms. Allocated memory is still 212.9MB. Free memory is still 161.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 367.95ms. Allocated memory is still 212.9MB. Free memory was 144.1MB in the beginning and 125.5MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.06ms. Allocated memory is still 212.9MB. Free memory was 125.5MB in the beginning and 123.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.63ms. Allocated memory is still 212.9MB. Free memory was 123.4MB in the beginning and 121.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 417.89ms. Allocated memory is still 212.9MB. Free memory was 121.0MB in the beginning and 104.8MB in the end (delta: 16.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 71163.33ms. Allocated memory was 212.9MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 103.9MB in the beginning and 821.2MB in the end (delta: -717.3MB). Peak memory consumption was 671.4MB. 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 - TimeoutResultAtElement [Line: 1035]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1035). Cancelled while NwaCegarLoop was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-6-1 term,while PolyPacSimplificationTermWalker was simplifying 6 xjuncts wrt. a ∧-84-3-6-2-5-2-4-2-3-3-3-2-1 context. - TimeoutResultAtElement [Line: 1026]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1026). Cancelled while NwaCegarLoop was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-6-1 term,while PolyPacSimplificationTermWalker was simplifying 6 xjuncts wrt. a ∧-84-3-6-2-5-2-4-2-3-3-3-2-1 context. - TimeoutResultAtElement [Line: 1031]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1031). Cancelled while NwaCegarLoop was analyzing trace of length 19 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-6-1 term,while PolyPacSimplificationTermWalker was simplifying 6 xjuncts wrt. a ∧-84-3-6-2-5-2-4-2-3-3-3-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 71.1s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 101 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 101 mSDsluCounter, 391 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 37 IncrementalHoareTripleChecker+Unchecked, 205 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 149 IncrementalHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 186 mSDtfsCounter, 149 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=7, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 52 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 87 ConstructedInterpolants, 9 QuantifiedInterpolants, 827 SizeOfPredicates, 4 NumberOfNonLiveVariables, 155 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 4/10 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown