/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 false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/list-properties/alternating_list-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 04:36:19,538 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 04:36:19,599 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-16 04:36:19,603 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 04:36:19,604 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 04:36:19,640 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 04:36:19,640 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 04:36:19,641 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 04:36:19,641 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 04:36:19,641 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 04:36:19,642 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 04:36:19,642 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 04:36:19,643 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 04:36:19,643 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 04:36:19,643 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 04:36:19,644 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 04:36:19,644 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 04:36:19,644 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 04:36:19,645 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 04:36:19,645 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 04:36:19,645 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 04:36:19,653 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 04:36:19,653 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 04:36:19,654 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 04:36:19,654 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 04:36:19,655 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 04:36:19,655 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 04:36:19,655 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 04:36:19,656 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 04:36:19,656 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 04:36:19,656 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 04:36:19,657 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 04:36:19,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:36:19,657 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 04:36:19,658 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 04:36:19,658 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 04:36:19,658 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 04:36:19,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 04:36:19,659 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 04:36:19,659 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 04:36:19,660 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 04:36:19,660 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 04:36:19,666 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 04:36:19,666 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 -> false [2023-12-16 04:36:19,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 04:36:19,913 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 04:36:19,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 04:36:19,916 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 04:36:19,917 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 04:36:19,918 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/alternating_list-1.i [2023-12-16 04:36:21,133 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 04:36:21,383 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 04:36:21,383 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/alternating_list-1.i [2023-12-16 04:36:21,398 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b093208a/24cabbc8efac4c0ca51ed8373a9ecf7f/FLAGa1803fc10 [2023-12-16 04:36:21,410 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b093208a/24cabbc8efac4c0ca51ed8373a9ecf7f [2023-12-16 04:36:21,412 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 04:36:21,413 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 04:36:21,414 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 04:36:21,414 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 04:36:21,421 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 04:36:21,421 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:36:21" (1/1) ... [2023-12-16 04:36:21,422 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47e6b3c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:36:21, skipping insertion in model container [2023-12-16 04:36:21,422 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:36:21" (1/1) ... [2023-12-16 04:36:21,495 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 04:36:21,781 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-properties/alternating_list-1.i[23574,23587] [2023-12-16 04:36:21,786 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:36:21,800 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 04:36:21,860 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-properties/alternating_list-1.i[23574,23587] [2023-12-16 04:36:21,864 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:36:21,898 INFO L206 MainTranslator]: Completed translation [2023-12-16 04:36:21,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:36:21 WrapperNode [2023-12-16 04:36:21,898 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 04:36:21,900 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 04:36:21,900 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 04:36:21,900 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 04:36:21,906 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:36:21" (1/1) ... [2023-12-16 04:36:21,923 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:36:21" (1/1) ... [2023-12-16 04:36:21,941 INFO L138 Inliner]: procedures = 124, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 86 [2023-12-16 04:36:21,941 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 04:36:21,942 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 04:36:21,942 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 04:36:21,942 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 04:36:21,950 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:36:21" (1/1) ... [2023-12-16 04:36:21,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:36:21" (1/1) ... [2023-12-16 04:36:21,957 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:36:21" (1/1) ... [2023-12-16 04:36:21,970 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [2, 11]. 85 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2023-12-16 04:36:21,971 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:36:21" (1/1) ... [2023-12-16 04:36:21,971 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:36:21" (1/1) ... [2023-12-16 04:36:21,975 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:36:21" (1/1) ... [2023-12-16 04:36:21,978 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:36:21" (1/1) ... [2023-12-16 04:36:21,979 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:36:21" (1/1) ... [2023-12-16 04:36:21,980 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:36:21" (1/1) ... [2023-12-16 04:36:21,982 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 04:36:21,983 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 04:36:21,983 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 04:36:21,983 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 04:36:21,984 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:36:21" (1/1) ... [2023-12-16 04:36:21,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:36:22,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:36:22,011 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-16 04:36:22,038 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-16 04:36:22,046 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-12-16 04:36:22,047 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-12-16 04:36:22,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-16 04:36:22,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-16 04:36:22,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-16 04:36:22,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-16 04:36:22,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-16 04:36:22,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 04:36:22,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-16 04:36:22,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-16 04:36:22,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-16 04:36:22,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-16 04:36:22,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 04:36:22,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 04:36:22,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 04:36:22,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 04:36:22,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 04:36:22,139 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 04:36:22,141 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 04:36:22,175 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-12-16 04:36:22,305 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 04:36:22,322 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 04:36:22,322 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-16 04:36:22,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:36:22 BoogieIcfgContainer [2023-12-16 04:36:22,323 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 04:36:22,325 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 04:36:22,325 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 04:36:22,328 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 04:36:22,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:36:21" (1/3) ... [2023-12-16 04:36:22,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10211b1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:36:22, skipping insertion in model container [2023-12-16 04:36:22,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:36:21" (2/3) ... [2023-12-16 04:36:22,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10211b1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:36:22, skipping insertion in model container [2023-12-16 04:36:22,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:36:22" (3/3) ... [2023-12-16 04:36:22,330 INFO L112 eAbstractionObserver]: Analyzing ICFG alternating_list-1.i [2023-12-16 04:36:22,345 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 04:36:22,346 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 04:36:22,380 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 04:36:22,385 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;@2f8980f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 04:36:22,385 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 04:36:22,389 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 26 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:36:22,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-16 04:36:22,399 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:36:22,399 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:36:22,400 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:36:22,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:36:22,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1696129172, now seen corresponding path program 1 times [2023-12-16 04:36:22,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:36:22,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330527428] [2023-12-16 04:36:22,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:36:22,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:36:22,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:36:22,604 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-16 04:36:22,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:36:22,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330527428] [2023-12-16 04:36:22,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330527428] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:36:22,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:36:22,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 04:36:22,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168580617] [2023-12-16 04:36:22,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:36:22,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 04:36:22,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:36:22,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 04:36:22,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:36:22,633 INFO L87 Difference]: Start difference. First operand has 28 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 26 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-16 04:36:22,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:36:22,660 INFO L93 Difference]: Finished difference Result 43 states and 60 transitions. [2023-12-16 04:36:22,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 04:36:22,661 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2023-12-16 04:36:22,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:36:22,665 INFO L225 Difference]: With dead ends: 43 [2023-12-16 04:36:22,665 INFO L226 Difference]: Without dead ends: 18 [2023-12-16 04:36:22,668 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-16 04:36:22,670 INFO L413 NwaCegarLoop]: 33 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, 33 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-16 04:36:22,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:36:22,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-12-16 04:36:22,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-12-16 04:36:22,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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-16 04:36:22,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2023-12-16 04:36:22,697 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2023-12-16 04:36:22,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:36:22,697 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-12-16 04:36:22,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-16 04:36:22,698 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2023-12-16 04:36:22,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-16 04:36:22,698 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:36:22,698 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:36:22,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 04:36:22,699 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:36:22,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:36:22,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1961675887, now seen corresponding path program 1 times [2023-12-16 04:36:22,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:36:22,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146592088] [2023-12-16 04:36:22,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:36:22,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:36:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:36:22,822 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-16 04:36:22,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:36:22,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146592088] [2023-12-16 04:36:22,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146592088] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:36:22,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:36:22,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:36:22,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933299471] [2023-12-16 04:36:22,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:36:22,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:36:22,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:36:22,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:36:22,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:36:22,825 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-16 04:36:22,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:36:22,847 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2023-12-16 04:36:22,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:36:22,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2023-12-16 04:36:22,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:36:22,849 INFO L225 Difference]: With dead ends: 46 [2023-12-16 04:36:22,849 INFO L226 Difference]: Without dead ends: 31 [2023-12-16 04:36:22,850 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-16 04:36:22,853 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 12 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:36:22,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 36 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:36:22,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-16 04:36:22,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2023-12-16 04:36:22,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 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-16 04:36:22,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2023-12-16 04:36:22,863 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 11 [2023-12-16 04:36:22,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:36:22,863 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2023-12-16 04:36:22,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-16 04:36:22,864 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2023-12-16 04:36:22,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-16 04:36:22,864 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:36:22,864 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:36:22,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 04:36:22,865 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:36:22,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:36:22,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1961668943, now seen corresponding path program 1 times [2023-12-16 04:36:22,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:36:22,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680579243] [2023-12-16 04:36:22,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:36:22,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:36:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:36:23,065 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-16 04:36:23,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:36:23,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680579243] [2023-12-16 04:36:23,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680579243] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:36:23,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:36:23,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:36:23,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029032312] [2023-12-16 04:36:23,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:36:23,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:36:23,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:36:23,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:36:23,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:36:23,068 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-16 04:36:23,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:36:23,147 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2023-12-16 04:36:23,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:36:23,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 11 [2023-12-16 04:36:23,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:36:23,150 INFO L225 Difference]: With dead ends: 56 [2023-12-16 04:36:23,150 INFO L226 Difference]: Without dead ends: 41 [2023-12-16 04:36:23,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:36:23,152 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:36:23,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 52 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:36:23,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-16 04:36:23,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2023-12-16 04:36:23,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 04:36:23,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2023-12-16 04:36:23,156 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 11 [2023-12-16 04:36:23,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:36:23,156 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2023-12-16 04:36:23,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-16 04:36:23,156 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2023-12-16 04:36:23,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-16 04:36:23,157 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:36:23,157 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:36:23,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 04:36:23,157 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:36:23,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:36:23,158 INFO L85 PathProgramCache]: Analyzing trace with hash -49019430, now seen corresponding path program 1 times [2023-12-16 04:36:23,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:36:23,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583714668] [2023-12-16 04:36:23,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:36:23,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:36:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:36:23,566 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-16 04:36:23,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:36:23,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583714668] [2023-12-16 04:36:23,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583714668] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:36:23,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459246899] [2023-12-16 04:36:23,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:36:23,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:36:23,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:36:23,572 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-16 04:36:23,605 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-16 04:36:23,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:36:23,673 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-16 04:36:23,679 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:36:23,730 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-16 04:36:23,836 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-16 04:36:23,895 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-16 04:36:23,898 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-16 04:36:23,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-16 04:36:24,018 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-16 04:36:24,081 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-16 04:36:24,081 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:36:24,109 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_75 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_75) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2023-12-16 04:36:24,150 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_74 (Array Int Int)) (v_ArrVal_75 (Array Int Int))) (or (not (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_74 .cse0))) v_ArrVal_74)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_74) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_75) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2023-12-16 04:36:24,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:36:24,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 74 [2023-12-16 04:36:24,282 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 58 treesize of output 54 [2023-12-16 04:36:24,303 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-16 04:36:24,321 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 102 treesize of output 98 [2023-12-16 04:36:24,423 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-16 04:36:24,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459246899] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:36:24,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:36:24,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2023-12-16 04:36:24,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289543781] [2023-12-16 04:36:24,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:36:24,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-16 04:36:24,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:36:24,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-16 04:36:24,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=249, Unknown=4, NotChecked=66, Total=380 [2023-12-16 04:36:24,427 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 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-16 04:36:24,753 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse2 (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_12| Int)) (or (forall ((v_ArrVal_74 (Array Int Int)) (v_ArrVal_75 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_74 .cse1)) v_ArrVal_74)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_74) |v_ULTIMATE.start_main_~t~0#1.base_12| v_ArrVal_75) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_12|) 0)))) (= .cse2 1) (forall ((v_ArrVal_74 (Array Int Int)) (v_ArrVal_75 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_74 .cse1)) v_ArrVal_74)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_74) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_75) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~flag~0#1| .cse2) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 1))) is different from false [2023-12-16 04:36:25,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:36:25,005 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2023-12-16 04:36:25,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-16 04:36:25,006 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 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 17 [2023-12-16 04:36:25,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:36:25,007 INFO L225 Difference]: With dead ends: 74 [2023-12-16 04:36:25,007 INFO L226 Difference]: Without dead ends: 72 [2023-12-16 04:36:25,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=169, Invalid=649, Unknown=6, NotChecked=168, Total=992 [2023-12-16 04:36:25,009 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 68 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 25 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 213 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:36:25,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 171 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 216 Invalid, 4 Unknown, 213 Unchecked, 0.3s Time] [2023-12-16 04:36:25,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-12-16 04:36:25,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 47. [2023-12-16 04:36:25,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 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-16 04:36:25,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2023-12-16 04:36:25,018 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 17 [2023-12-16 04:36:25,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:36:25,018 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2023-12-16 04:36:25,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 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-16 04:36:25,018 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2023-12-16 04:36:25,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-16 04:36:25,019 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:36:25,019 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:36:25,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-16 04:36:25,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:36:25,221 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:36:25,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:36:25,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1444880623, now seen corresponding path program 1 times [2023-12-16 04:36:25,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:36:25,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541352148] [2023-12-16 04:36:25,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:36:25,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:36:25,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:36:25,676 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:36:25,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:36:25,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541352148] [2023-12-16 04:36:25,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541352148] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:36:25,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654217375] [2023-12-16 04:36:25,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:36:25,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:36:25,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:36:25,681 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-16 04:36:25,708 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-16 04:36:25,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:36:25,770 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-16 04:36:25,775 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:36:25,782 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-16 04:36:25,858 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-16 04:36:25,859 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-16 04:36:25,890 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 15 treesize of output 1 [2023-12-16 04:36:25,898 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-16 04:36:25,962 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-16 04:36:25,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 57 [2023-12-16 04:36:25,970 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-12-16 04:36:25,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2023-12-16 04:36:26,033 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 31 treesize of output 19 [2023-12-16 04:36:26,039 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 19 treesize of output 11 [2023-12-16 04:36:26,045 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:36:26,046 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:36:26,081 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 79 treesize of output 57 [2023-12-16 04:36:26,089 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_128 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_ArrVal_126 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2023-12-16 04:36:26,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:36:26,111 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 22 treesize of output 23 [2023-12-16 04:36:26,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:36:26,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2023-12-16 04:36:26,123 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 11 treesize of output 7 [2023-12-16 04:36:26,137 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-16 04:36:26,137 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 1 case distinctions, treesize of input 22 treesize of output 1 [2023-12-16 04:36:26,248 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-16 04:36:26,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654217375] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:36:26,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:36:26,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2023-12-16 04:36:26,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851266757] [2023-12-16 04:36:26,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:36:26,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-16 04:36:26,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:36:26,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-16 04:36:26,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=229, Unknown=1, NotChecked=30, Total=306 [2023-12-16 04:36:26,252 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 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-16 04:36:26,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:36:26,601 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2023-12-16 04:36:26,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 04:36:26,602 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 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 22 [2023-12-16 04:36:26,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:36:26,606 INFO L225 Difference]: With dead ends: 90 [2023-12-16 04:36:26,606 INFO L226 Difference]: Without dead ends: 70 [2023-12-16 04:36:26,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=529, Unknown=1, NotChecked=48, Total=702 [2023-12-16 04:36:26,608 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 108 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:36:26,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 157 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 194 Invalid, 0 Unknown, 63 Unchecked, 0.2s Time] [2023-12-16 04:36:26,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-16 04:36:26,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2023-12-16 04:36:26,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 51 states have internal predecessors, (60), 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-16 04:36:26,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2023-12-16 04:36:26,617 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 22 [2023-12-16 04:36:26,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:36:26,617 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2023-12-16 04:36:26,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 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-16 04:36:26,617 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2023-12-16 04:36:26,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-16 04:36:26,619 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:36:26,619 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:36:26,630 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-16 04:36:26,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:36:26,826 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:36:26,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:36:26,826 INFO L85 PathProgramCache]: Analyzing trace with hash 2001737604, now seen corresponding path program 2 times [2023-12-16 04:36:26,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:36:26,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038718600] [2023-12-16 04:36:26,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:36:26,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:36:26,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:36:26,864 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-16 04:36:26,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:36:26,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038718600] [2023-12-16 04:36:26,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038718600] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:36:26,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:36:26,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:36:26,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772170761] [2023-12-16 04:36:26,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:36:26,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:36:26,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:36:26,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:36:26,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:36:26,866 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-16 04:36:26,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:36:26,880 INFO L93 Difference]: Finished difference Result 91 states and 105 transitions. [2023-12-16 04:36:26,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:36:26,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 28 [2023-12-16 04:36:26,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:36:26,883 INFO L225 Difference]: With dead ends: 91 [2023-12-16 04:36:26,883 INFO L226 Difference]: Without dead ends: 50 [2023-12-16 04:36:26,883 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-16 04:36:26,884 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 7 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:36:26,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 40 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:36:26,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-12-16 04:36:26,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2023-12-16 04:36:26,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.108695652173913) internal successors, (51), 46 states have internal predecessors, (51), 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-16 04:36:26,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2023-12-16 04:36:26,890 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 28 [2023-12-16 04:36:26,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:36:26,891 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2023-12-16 04:36:26,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-16 04:36:26,891 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2023-12-16 04:36:26,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-16 04:36:26,891 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:36:26,892 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:36:26,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 04:36:26,892 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:36:26,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:36:26,892 INFO L85 PathProgramCache]: Analyzing trace with hash 413389702, now seen corresponding path program 1 times [2023-12-16 04:36:26,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:36:26,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130288746] [2023-12-16 04:36:26,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:36:26,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:36:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:36:27,747 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:36:27,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:36:27,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130288746] [2023-12-16 04:36:27,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130288746] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:36:27,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113112197] [2023-12-16 04:36:27,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:36:27,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:36:27,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:36:27,749 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:36:27,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-16 04:36:27,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:36:27,853 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 55 conjunts are in the unsatisfiable core [2023-12-16 04:36:27,857 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:36:27,860 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-16 04:36:27,935 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-16 04:36:27,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-16 04:36:27,988 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-16 04:36:27,997 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 19 treesize of output 1 [2023-12-16 04:36:28,061 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-16 04:36:28,074 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-16 04:36:28,074 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 18 treesize of output 17 [2023-12-16 04:36:28,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-16 04:36:28,094 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-16 04:36:28,095 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 30 [2023-12-16 04:36:28,149 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2023-12-16 04:36:28,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2023-12-16 04:36:28,217 INFO L349 Elim1Store]: treesize reduction 51, result has 15.0 percent of original size [2023-12-16 04:36:28,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 219 treesize of output 143 [2023-12-16 04:36:28,223 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 160 treesize of output 133 [2023-12-16 04:36:28,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 23 [2023-12-16 04:36:28,372 INFO L349 Elim1Store]: treesize reduction 60, result has 15.5 percent of original size [2023-12-16 04:36:28,373 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 212 treesize of output 161 [2023-12-16 04:36:28,386 INFO L349 Elim1Store]: treesize reduction 33, result has 13.2 percent of original size [2023-12-16 04:36:28,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 151 [2023-12-16 04:36:28,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 23 [2023-12-16 04:36:28,654 INFO L349 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-12-16 04:36:28,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 32 [2023-12-16 04:36:28,658 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 23 treesize of output 11 [2023-12-16 04:36:28,792 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:36:28,792 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:36:28,893 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (= 2 (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_253) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_251) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2023-12-16 04:36:28,915 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_253 (Array Int Int)) (v_ArrVal_247 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (not (= v_ArrVal_247 (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_247 .cse0)))) (= 2 (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_247) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_253) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_251) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))))) is different from false [2023-12-16 04:36:29,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:36:29,031 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46 [2023-12-16 04:36:29,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:36:29,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 262 treesize of output 266 [2023-12-16 04:36:29,053 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 226 treesize of output 190 [2023-12-16 04:36:29,114 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 527 treesize of output 473 [2023-12-16 04:36:29,212 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 30 treesize of output 22 [2023-12-16 04:36:29,227 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 33 treesize of output 25 [2023-12-16 04:36:29,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:36:29,428 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 29 treesize of output 30 [2023-12-16 04:36:29,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:36:29,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 157 [2023-12-16 04:36:29,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:36:29,446 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 72 treesize of output 64 [2023-12-16 04:36:29,450 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 28 treesize of output 20 [2023-12-16 04:36:29,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:36:29,485 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 25 treesize of output 26 [2023-12-16 04:36:29,487 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:36:29,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:36:29,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2023-12-16 04:36:29,496 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 11 treesize of output 7 [2023-12-16 04:36:29,510 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:36:29,510 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 28 treesize of output 29 [2023-12-16 04:36:29,512 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:36:29,519 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:36:29,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 38 [2023-12-16 04:36:29,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2023-12-16 04:36:29,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:36:29,541 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 34 treesize of output 35 [2023-12-16 04:36:29,544 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:36:29,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:36:29,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2023-12-16 04:36:29,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:36:29,559 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 41 treesize of output 33 [2023-12-16 04:36:29,596 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-16 04:36:29,597 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 65 treesize of output 1 [2023-12-16 04:36:30,254 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-12-16 04:36:30,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113112197] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:36:30,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:36:30,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 30 [2023-12-16 04:36:30,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884031327] [2023-12-16 04:36:30,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:36:30,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-16 04:36:30,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:36:30,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-16 04:36:30,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=713, Unknown=6, NotChecked=110, Total=930 [2023-12-16 04:36:30,256 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 31 states, 31 states have (on average 2.3870967741935485) internal successors, (74), 30 states have internal predecessors, (74), 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-16 04:36:31,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:36:31,221 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2023-12-16 04:36:31,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-16 04:36:31,221 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.3870967741935485) internal successors, (74), 30 states have internal predecessors, (74), 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 28 [2023-12-16 04:36:31,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:36:31,222 INFO L225 Difference]: With dead ends: 66 [2023-12-16 04:36:31,222 INFO L226 Difference]: Without dead ends: 64 [2023-12-16 04:36:31,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=228, Invalid=1412, Unknown=8, NotChecked=158, Total=1806 [2023-12-16 04:36:31,223 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 83 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 22 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 04:36:31,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 225 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 357 Invalid, 1 Unknown, 119 Unchecked, 0.4s Time] [2023-12-16 04:36:31,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-12-16 04:36:31,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 52. [2023-12-16 04:36:31,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 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-16 04:36:31,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2023-12-16 04:36:31,229 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 28 [2023-12-16 04:36:31,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:36:31,229 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2023-12-16 04:36:31,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.3870967741935485) internal successors, (74), 30 states have internal predecessors, (74), 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-16 04:36:31,230 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2023-12-16 04:36:31,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-16 04:36:31,230 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:36:31,230 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:36:31,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-16 04:36:31,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:36:31,437 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:36:31,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:36:31,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1585456750, now seen corresponding path program 1 times [2023-12-16 04:36:31,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:36:31,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081729375] [2023-12-16 04:36:31,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:36:31,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:36:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:36:32,093 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:36:32,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:36:32,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081729375] [2023-12-16 04:36:32,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081729375] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:36:32,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121219054] [2023-12-16 04:36:32,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:36:32,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:36:32,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:36:32,095 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:36:32,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-16 04:36:32,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:36:32,200 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 61 conjunts are in the unsatisfiable core [2023-12-16 04:36:32,205 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:36:32,209 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-16 04:36:32,288 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-16 04:36:32,330 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-16 04:36:32,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-12-16 04:36:32,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-16 04:36:32,417 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-16 04:36:32,429 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-16 04:36:32,429 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 11 treesize of output 11 [2023-12-16 04:36:32,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-16 04:36:32,467 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-16 04:36:32,502 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-16 04:36:32,541 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-12-16 04:36:32,541 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 19 treesize of output 22 [2023-12-16 04:36:32,643 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:36:32,643 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:36:32,709 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_367 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_367))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_50|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= .cse0 3)))) is different from false [2023-12-16 04:36:32,723 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_367 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_367))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 3) (= .cse0 1)))) is different from false [2023-12-16 04:36:32,753 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_363 (Array Int Int)) (v_ArrVal_367 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_363) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_367))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 3) (= .cse0 1)))) is different from false [2023-12-16 04:36:32,816 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_363 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_20| Int) (v_ArrVal_367 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_363) |v_ULTIMATE.start_main_~t~0#1.base_20| v_ArrVal_367))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 3 .cse0) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_20|) 0)) (= .cse0 1)))) is different from false [2023-12-16 04:36:32,851 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_358 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_363 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_20| Int) (v_ArrVal_367 (Array Int Int))) (let ((.cse1 (select (select (let ((.cse2 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_363) |v_ULTIMATE.start_main_~t~0#1.base_20| v_ArrVal_367))) (store .cse2 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse2 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= v_ArrVal_358 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_358 .cse0))))) (= .cse1 3) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_20|) 0)) (= .cse1 1)))) is different from false [2023-12-16 04:36:32,887 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_357 Int) (v_ArrVal_358 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_363 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_20| Int) (|v_ULTIMATE.start_main_~t~0#1.base_21| Int) (v_ArrVal_367 (Array Int Int))) (let ((.cse1 (select (select (let ((.cse2 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_358) |v_ULTIMATE.start_main_~t~0#1.base_21| v_ArrVal_363) |v_ULTIMATE.start_main_~t~0#1.base_20| v_ArrVal_367))) (store .cse2 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse2 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= v_ArrVal_358 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_358 .cse0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_21|) 0)) (= .cse1 1) (= .cse1 3) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_21| v_ArrVal_357) |v_ULTIMATE.start_main_~t~0#1.base_20|) 0))))) is different from false [2023-12-16 04:36:33,073 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:36:33,078 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 2732029 treesize of output 2703379 [2023-12-16 04:36:34,262 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 4571 treesize of output 4443 [2023-12-16 04:36:34,397 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 4587 treesize of output 4331 Received shutdown request... [2023-12-16 04:37:28,409 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 04:37:28,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-16 04:37:28,445 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-16 04:37:28,449 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 04:37:28,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:37:28,616 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-26-4-5-4-5-3-2-3-3-1 context. [2023-12-16 04:37:28,620 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2023-12-16 04:37:28,623 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 04:37:28,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:37:28 BoogieIcfgContainer [2023-12-16 04:37:28,626 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 04:37:28,627 INFO L158 Benchmark]: Toolchain (without parser) took 67213.02ms. Allocated memory was 182.5MB in the beginning and 1.2GB in the end (delta: 985.7MB). Free memory was 134.7MB in the beginning and 800.3MB in the end (delta: -665.7MB). Peak memory consumption was 691.6MB. Max. memory is 8.0GB. [2023-12-16 04:37:28,629 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 182.5MB. Free memory is still 140.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:37:28,629 INFO L158 Benchmark]: CACSL2BoogieTranslator took 484.93ms. Allocated memory is still 182.5MB. Free memory was 134.4MB in the beginning and 116.9MB in the end (delta: 17.5MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-16 04:37:28,630 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.32ms. Allocated memory is still 182.5MB. Free memory was 116.9MB in the beginning and 115.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 04:37:28,630 INFO L158 Benchmark]: Boogie Preprocessor took 40.46ms. Allocated memory is still 182.5MB. Free memory was 115.1MB in the beginning and 112.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 04:37:28,631 INFO L158 Benchmark]: RCFGBuilder took 339.69ms. Allocated memory is still 182.5MB. Free memory was 112.7MB in the beginning and 153.1MB in the end (delta: -40.4MB). Peak memory consumption was 16.3MB. Max. memory is 8.0GB. [2023-12-16 04:37:28,631 INFO L158 Benchmark]: TraceAbstraction took 66301.20ms. Allocated memory was 182.5MB in the beginning and 1.2GB in the end (delta: 985.7MB). Free memory was 152.6MB in the beginning and 800.3MB in the end (delta: -647.8MB). Peak memory consumption was 708.9MB. Max. memory is 8.0GB. [2023-12-16 04:37:28,633 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.13ms. Allocated memory is still 182.5MB. Free memory is still 140.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 484.93ms. Allocated memory is still 182.5MB. Free memory was 134.4MB in the beginning and 116.9MB in the end (delta: 17.5MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.32ms. Allocated memory is still 182.5MB. Free memory was 116.9MB in the beginning and 115.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.46ms. Allocated memory is still 182.5MB. Free memory was 115.1MB in the beginning and 112.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 339.69ms. Allocated memory is still 182.5MB. Free memory was 112.7MB in the beginning and 153.1MB in the end (delta: -40.4MB). Peak memory consumption was 16.3MB. Max. memory is 8.0GB. * TraceAbstraction took 66301.20ms. Allocated memory was 182.5MB in the beginning and 1.2GB in the end (delta: 985.7MB). Free memory was 152.6MB in the beginning and 800.3MB in the end (delta: -647.8MB). Peak memory consumption was 708.9MB. 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: 573]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 573). Cancelled while NwaCegarLoop was analyzing trace of length 30 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-26-4-5-4-5-3-2-3-3-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 66.3s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 290 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 290 mSDsluCounter, 714 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 395 IncrementalHoareTripleChecker+Unchecked, 572 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 816 IncrementalHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 142 mSDtfsCounter, 816 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 209 GetRequests, 104 SyntacticMatches, 2 SemanticMatches, 103 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=5, InterpolantAutomatonStates: 63, 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, 72 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 194 NumberOfCodeBlocks, 194 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 248 ConstructedInterpolants, 33 QuantifiedInterpolants, 5734 SizeOfPredicates, 33 NumberOfNonLiveVariables, 423 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 13 InterpolantComputations, 4 PerfectInterpolantSequences, 16/73 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