/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/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 04:31:16,777 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 04:31:16,840 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:31:16,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 04:31:16,844 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 04:31:16,866 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 04:31:16,867 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 04:31:16,867 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 04:31:16,868 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 04:31:16,871 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 04:31:16,871 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 04:31:16,872 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 04:31:16,872 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 04:31:16,873 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 04:31:16,873 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 04:31:16,874 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 04:31:16,874 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 04:31:16,874 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 04:31:16,874 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 04:31:16,875 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 04:31:16,875 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 04:31:16,875 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 04:31:16,875 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 04:31:16,876 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 04:31:16,876 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 04:31:16,876 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 04:31:16,876 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 04:31:16,876 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 04:31:16,877 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 04:31:16,877 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 04:31:16,877 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 04:31:16,877 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 04:31:16,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:31:16,878 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 04:31:16,878 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 04:31:16,878 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 04:31:16,878 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 04:31:16,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 04:31:16,878 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 04:31:16,878 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 04:31:16,878 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 04:31:16,879 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 04:31:16,879 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 04:31:16,879 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:31:17,083 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 04:31:17,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 04:31:17,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 04:31:17,103 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 04:31:17,103 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 04:31:17,104 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i [2023-12-16 04:31:18,099 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 04:31:18,263 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 04:31:18,264 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i [2023-12-16 04:31:18,276 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f10422b7f/de56db32187b46218f08e4dbd66062de/FLAGd3389d228 [2023-12-16 04:31:18,286 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f10422b7f/de56db32187b46218f08e4dbd66062de [2023-12-16 04:31:18,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 04:31:18,289 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 04:31:18,289 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 04:31:18,290 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 04:31:18,301 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 04:31:18,301 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:31:18" (1/1) ... [2023-12-16 04:31:18,302 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b6b4963 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:31:18, skipping insertion in model container [2023-12-16 04:31:18,302 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:31:18" (1/1) ... [2023-12-16 04:31:18,328 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 04:31:18,418 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i[917,930] [2023-12-16 04:31:18,458 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:31:18,467 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 04:31:18,475 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i[917,930] [2023-12-16 04:31:18,511 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:31:18,540 INFO L206 MainTranslator]: Completed translation [2023-12-16 04:31:18,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:31:18 WrapperNode [2023-12-16 04:31:18,540 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 04:31:18,541 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 04:31:18,541 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 04:31:18,541 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 04:31:18,546 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:31:18" (1/1) ... [2023-12-16 04:31:18,554 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:31:18" (1/1) ... [2023-12-16 04:31:18,581 INFO L138 Inliner]: procedures = 29, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 469 [2023-12-16 04:31:18,581 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 04:31:18,582 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 04:31:18,582 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 04:31:18,582 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 04:31:18,600 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:31:18" (1/1) ... [2023-12-16 04:31:18,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:31:18" (1/1) ... [2023-12-16 04:31:18,604 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:31:18" (1/1) ... [2023-12-16 04:31:18,634 INFO L175 MemorySlicer]: Split 126 memory accesses to 2 slices as follows [2, 124]. 98 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 14]. The 17 writes are split as follows [0, 17]. [2023-12-16 04:31:18,634 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:31:18" (1/1) ... [2023-12-16 04:31:18,634 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:31:18" (1/1) ... [2023-12-16 04:31:18,654 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:31:18" (1/1) ... [2023-12-16 04:31:18,657 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:31:18" (1/1) ... [2023-12-16 04:31:18,659 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:31:18" (1/1) ... [2023-12-16 04:31:18,661 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:31:18" (1/1) ... [2023-12-16 04:31:18,663 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 04:31:18,669 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 04:31:18,669 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 04:31:18,669 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 04:31:18,670 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:31:18" (1/1) ... [2023-12-16 04:31:18,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:31:18,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:31:18,700 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:31:18,719 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:31:18,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 04:31:18,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-16 04:31:18,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-16 04:31:18,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-16 04:31:18,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-16 04:31:18,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-16 04:31:18,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-16 04:31:18,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-16 04:31:18,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-16 04:31:18,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-16 04:31:18,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-16 04:31:18,728 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 04:31:18,728 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 04:31:18,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 04:31:18,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 04:31:18,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 04:31:18,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 04:31:18,853 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 04:31:18,855 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 04:31:19,190 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 04:31:19,213 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 04:31:19,213 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 04:31:19,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:31:19 BoogieIcfgContainer [2023-12-16 04:31:19,213 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 04:31:19,215 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 04:31:19,215 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 04:31:19,217 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 04:31:19,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:31:18" (1/3) ... [2023-12-16 04:31:19,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@297a2b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:31:19, skipping insertion in model container [2023-12-16 04:31:19,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:31:18" (2/3) ... [2023-12-16 04:31:19,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@297a2b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:31:19, skipping insertion in model container [2023-12-16 04:31:19,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:31:19" (3/3) ... [2023-12-16 04:31:19,219 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-24.i [2023-12-16 04:31:19,230 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 04:31:19,230 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 04:31:19,262 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 04:31:19,267 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;@19c5125e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 04:31:19,267 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 04:31:19,270 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 77 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:31:19,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-16 04:31:19,280 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:31:19,281 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:31:19,281 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:31:19,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:31:19,285 INFO L85 PathProgramCache]: Analyzing trace with hash -230866532, now seen corresponding path program 1 times [2023-12-16 04:31:19,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:31:19,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290011173] [2023-12-16 04:31:19,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:31:19,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:31:19,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:19,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:31:19,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:19,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:31:19,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:19,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:31:19,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:19,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:31:19,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:19,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:31:19,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:19,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:31:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:19,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:31:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:19,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:31:19,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:19,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:31:19,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:19,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:31:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:19,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:31:19,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:19,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:31:19,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:19,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:31:19,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:19,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:31:19,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:19,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:31:19,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:19,638 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:31:19,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:31:19,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290011173] [2023-12-16 04:31:19,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290011173] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:31:19,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:31:19,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 04:31:19,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263825039] [2023-12-16 04:31:19,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:31:19,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 04:31:19,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:31:19,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 04:31:19,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:31:19,671 INFO L87 Difference]: Start difference. First operand has 94 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 77 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 04:31:19,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:31:19,713 INFO L93 Difference]: Finished difference Result 185 states and 291 transitions. [2023-12-16 04:31:19,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 04:31:19,715 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 119 [2023-12-16 04:31:19,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:31:19,721 INFO L225 Difference]: With dead ends: 185 [2023-12-16 04:31:19,721 INFO L226 Difference]: Without dead ends: 92 [2023-12-16 04:31:19,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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:31:19,727 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:31:19,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:31:19,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-12-16 04:31:19,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-12-16 04:31:19,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 75 states have internal predecessors, (104), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:31:19,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2023-12-16 04:31:19,760 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 119 [2023-12-16 04:31:19,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:31:19,761 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2023-12-16 04:31:19,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 04:31:19,761 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2023-12-16 04:31:19,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-16 04:31:19,764 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:31:19,764 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:31:19,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 04:31:19,764 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:31:19,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:31:19,765 INFO L85 PathProgramCache]: Analyzing trace with hash -138391050, now seen corresponding path program 1 times [2023-12-16 04:31:19,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:31:19,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612062072] [2023-12-16 04:31:19,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:31:19,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:31:19,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:19,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:31:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:19,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:31:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:19,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:31:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:19,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:31:19,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:19,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:31:19,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:19,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:31:19,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:19,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:31:19,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:19,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:31:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:19,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:31:19,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:19,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:31:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:19,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:31:19,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:19,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:31:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:19,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:31:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:19,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:31:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:19,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:31:20,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,008 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:31:20,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:31:20,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612062072] [2023-12-16 04:31:20,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612062072] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:31:20,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:31:20,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:31:20,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424326895] [2023-12-16 04:31:20,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:31:20,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:31:20,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:31:20,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:31:20,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:31:20,018 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:31:20,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:31:20,061 INFO L93 Difference]: Finished difference Result 184 states and 269 transitions. [2023-12-16 04:31:20,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:31:20,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2023-12-16 04:31:20,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:31:20,065 INFO L225 Difference]: With dead ends: 184 [2023-12-16 04:31:20,065 INFO L226 Difference]: Without dead ends: 93 [2023-12-16 04:31:20,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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:31:20,067 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:31:20,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 253 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:31:20,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-12-16 04:31:20,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-12-16 04:31:20,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 76 states have (on average 1.381578947368421) internal successors, (105), 76 states have internal predecessors, (105), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:31:20,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2023-12-16 04:31:20,077 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 119 [2023-12-16 04:31:20,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:31:20,080 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2023-12-16 04:31:20,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:31:20,080 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2023-12-16 04:31:20,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-16 04:31:20,086 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:31:20,086 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:31:20,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 04:31:20,087 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:31:20,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:31:20,087 INFO L85 PathProgramCache]: Analyzing trace with hash 80463668, now seen corresponding path program 1 times [2023-12-16 04:31:20,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:31:20,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592995748] [2023-12-16 04:31:20,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:31:20,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:31:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:31:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:31:20,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:31:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:31:20,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:31:20,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:31:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:31:20,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:31:20,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:31:20,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:31:20,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:31:20,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:31:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:31:20,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:31:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:31:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,241 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:31:20,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:31:20,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592995748] [2023-12-16 04:31:20,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592995748] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:31:20,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:31:20,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:31:20,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664244594] [2023-12-16 04:31:20,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:31:20,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:31:20,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:31:20,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:31:20,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:31:20,246 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:31:20,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:31:20,279 INFO L93 Difference]: Finished difference Result 205 states and 299 transitions. [2023-12-16 04:31:20,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:31:20,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2023-12-16 04:31:20,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:31:20,282 INFO L225 Difference]: With dead ends: 205 [2023-12-16 04:31:20,283 INFO L226 Difference]: Without dead ends: 113 [2023-12-16 04:31:20,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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:31:20,288 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 40 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:31:20,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 269 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:31:20,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-12-16 04:31:20,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 94. [2023-12-16 04:31:20,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 77 states have internal predecessors, (106), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:31:20,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2023-12-16 04:31:20,303 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 119 [2023-12-16 04:31:20,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:31:20,304 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2023-12-16 04:31:20,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:31:20,304 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2023-12-16 04:31:20,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-16 04:31:20,305 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:31:20,305 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:31:20,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 04:31:20,305 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:31:20,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:31:20,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1199400010, now seen corresponding path program 1 times [2023-12-16 04:31:20,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:31:20,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101354258] [2023-12-16 04:31:20,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:31:20,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:31:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:31:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:31:20,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:31:20,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:31:20,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:31:20,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:31:20,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:31:20,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:31:20,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:31:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:31:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:31:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:31:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:31:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:31:20,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:31:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,503 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:31:20,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:31:20,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101354258] [2023-12-16 04:31:20,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101354258] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:31:20,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:31:20,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:31:20,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775510032] [2023-12-16 04:31:20,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:31:20,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:31:20,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:31:20,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:31:20,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:31:20,505 INFO L87 Difference]: Start difference. First operand 94 states and 136 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:31:20,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:31:20,548 INFO L93 Difference]: Finished difference Result 199 states and 288 transitions. [2023-12-16 04:31:20,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:31:20,549 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2023-12-16 04:31:20,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:31:20,551 INFO L225 Difference]: With dead ends: 199 [2023-12-16 04:31:20,551 INFO L226 Difference]: Without dead ends: 106 [2023-12-16 04:31:20,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:31:20,557 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 21 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:31:20,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 381 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:31:20,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-12-16 04:31:20,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 96. [2023-12-16 04:31:20,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 79 states have (on average 1.3670886075949367) internal successors, (108), 79 states have internal predecessors, (108), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:31:20,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2023-12-16 04:31:20,570 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 119 [2023-12-16 04:31:20,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:31:20,570 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2023-12-16 04:31:20,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:31:20,570 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2023-12-16 04:31:20,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-16 04:31:20,573 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:31:20,573 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:31:20,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 04:31:20,573 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:31:20,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:31:20,574 INFO L85 PathProgramCache]: Analyzing trace with hash -2008746636, now seen corresponding path program 1 times [2023-12-16 04:31:20,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:31:20,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540633012] [2023-12-16 04:31:20,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:31:20,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:31:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:31:20,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:31:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:31:20,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:31:20,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:31:20,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:31:20,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:31:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:31:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:31:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:31:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:31:20,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:31:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:31:20,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:31:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:31:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,705 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:31:20,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:31:20,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540633012] [2023-12-16 04:31:20,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540633012] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:31:20,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:31:20,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:31:20,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703323502] [2023-12-16 04:31:20,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:31:20,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:31:20,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:31:20,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:31:20,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:31:20,707 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:31:20,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:31:20,736 INFO L93 Difference]: Finished difference Result 199 states and 286 transitions. [2023-12-16 04:31:20,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:31:20,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2023-12-16 04:31:20,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:31:20,738 INFO L225 Difference]: With dead ends: 199 [2023-12-16 04:31:20,738 INFO L226 Difference]: Without dead ends: 104 [2023-12-16 04:31:20,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:31:20,738 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 12 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:31:20,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 379 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:31:20,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-12-16 04:31:20,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2023-12-16 04:31:20,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 81 states have internal predecessors, (110), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:31:20,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2023-12-16 04:31:20,749 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 119 [2023-12-16 04:31:20,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:31:20,750 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2023-12-16 04:31:20,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:31:20,750 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2023-12-16 04:31:20,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-16 04:31:20,753 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:31:20,753 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:31:20,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 04:31:20,754 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:31:20,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:31:20,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1951488334, now seen corresponding path program 1 times [2023-12-16 04:31:20,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:31:20,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942178974] [2023-12-16 04:31:20,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:31:20,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:31:20,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:31:20,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:31:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:31:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:31:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:31:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:31:20,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:31:20,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:31:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:31:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:31:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:31:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:31:20,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:31:20,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:31:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:31:20,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:20,858 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:31:20,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:31:20,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942178974] [2023-12-16 04:31:20,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942178974] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:31:20,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:31:20,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:31:20,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592358622] [2023-12-16 04:31:20,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:31:20,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:31:20,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:31:20,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:31:20,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:31:20,859 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:31:20,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:31:20,884 INFO L93 Difference]: Finished difference Result 199 states and 284 transitions. [2023-12-16 04:31:20,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:31:20,884 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2023-12-16 04:31:20,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:31:20,887 INFO L225 Difference]: With dead ends: 199 [2023-12-16 04:31:20,887 INFO L226 Difference]: Without dead ends: 102 [2023-12-16 04:31:20,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:31:20,888 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 3 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:31:20,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 379 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:31:20,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-12-16 04:31:20,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2023-12-16 04:31:20,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 83 states have (on average 1.3493975903614457) internal successors, (112), 83 states have internal predecessors, (112), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:31:20,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2023-12-16 04:31:20,895 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 119 [2023-12-16 04:31:20,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:31:20,895 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2023-12-16 04:31:20,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:31:20,895 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2023-12-16 04:31:20,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-16 04:31:20,896 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:31:20,896 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:31:20,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 04:31:20,896 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:31:20,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:31:20,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1951428752, now seen corresponding path program 1 times [2023-12-16 04:31:20,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:31:20,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6198703] [2023-12-16 04:31:20,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:31:20,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:31:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:21,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:31:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:21,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:31:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:21,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:31:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:21,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:31:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:21,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:31:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:21,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:31:21,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:21,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:31:21,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:21,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:31:21,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:21,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:31:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:21,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:31:21,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:21,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:31:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:21,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:31:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:21,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:31:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:21,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:31:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:21,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:31:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:21,239 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:31:21,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:31:21,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6198703] [2023-12-16 04:31:21,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6198703] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:31:21,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:31:21,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:31:21,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489142096] [2023-12-16 04:31:21,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:31:21,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:31:21,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:31:21,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:31:21,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:31:21,241 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:31:21,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:31:21,463 INFO L93 Difference]: Finished difference Result 272 states and 383 transitions. [2023-12-16 04:31:21,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:31:21,463 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2023-12-16 04:31:21,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:31:21,464 INFO L225 Difference]: With dead ends: 272 [2023-12-16 04:31:21,464 INFO L226 Difference]: Without dead ends: 173 [2023-12-16 04:31:21,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-16 04:31:21,466 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 238 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:31:21,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 411 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:31:21,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-12-16 04:31:21,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 109. [2023-12-16 04:31:21,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 92 states have (on average 1.358695652173913) internal successors, (125), 92 states have internal predecessors, (125), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:31:21,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 155 transitions. [2023-12-16 04:31:21,472 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 155 transitions. Word has length 119 [2023-12-16 04:31:21,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:31:21,472 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 155 transitions. [2023-12-16 04:31:21,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:31:21,472 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 155 transitions. [2023-12-16 04:31:21,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-16 04:31:21,473 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:31:21,473 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:31:21,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 04:31:21,473 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:31:21,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:31:21,473 INFO L85 PathProgramCache]: Analyzing trace with hash -366054729, now seen corresponding path program 1 times [2023-12-16 04:31:21,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:31:21,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322943232] [2023-12-16 04:31:21,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:31:21,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:31:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:22,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:31:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:22,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:31:22,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:22,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:31:22,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:22,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:31:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:22,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:31:22,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:22,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:31:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:22,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:31:22,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:22,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:31:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:22,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:31:22,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:22,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:31:22,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:22,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:31:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:22,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:31:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:22,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:31:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:22,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:31:22,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:22,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:31:22,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:22,397 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:31:22,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:31:22,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322943232] [2023-12-16 04:31:22,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322943232] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:31:22,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:31:22,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 04:31:22,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819641766] [2023-12-16 04:31:22,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:31:22,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 04:31:22,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:31:22,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 04:31:22,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:31:22,399 INFO L87 Difference]: Start difference. First operand 109 states and 155 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 04:31:23,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:31:23,036 INFO L93 Difference]: Finished difference Result 389 states and 548 transitions. [2023-12-16 04:31:23,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 04:31:23,037 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 120 [2023-12-16 04:31:23,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:31:23,039 INFO L225 Difference]: With dead ends: 389 [2023-12-16 04:31:23,039 INFO L226 Difference]: Without dead ends: 281 [2023-12-16 04:31:23,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2023-12-16 04:31:23,039 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 416 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 04:31:23,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 348 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 04:31:23,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2023-12-16 04:31:23,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 125. [2023-12-16 04:31:23,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 108 states have (on average 1.3703703703703705) internal successors, (148), 108 states have internal predecessors, (148), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:31:23,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 178 transitions. [2023-12-16 04:31:23,048 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 178 transitions. Word has length 120 [2023-12-16 04:31:23,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:31:23,048 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 178 transitions. [2023-12-16 04:31:23,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 04:31:23,048 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 178 transitions. [2023-12-16 04:31:23,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-16 04:31:23,049 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:31:23,049 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:31:23,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 04:31:23,049 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:31:23,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:31:23,050 INFO L85 PathProgramCache]: Analyzing trace with hash 2123474233, now seen corresponding path program 1 times [2023-12-16 04:31:23,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:31:23,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625724097] [2023-12-16 04:31:23,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:31:23,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:31:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:23,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:31:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:23,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:31:23,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:23,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:31:23,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:23,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:31:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:23,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:31:23,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:23,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:31:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:23,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:31:23,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:23,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:31:23,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:23,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:31:23,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:23,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:31:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:23,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:31:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:23,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:31:23,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:23,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:31:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:23,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:31:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:23,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:31:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:23,686 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:31:23,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:31:23,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625724097] [2023-12-16 04:31:23,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625724097] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:31:23,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:31:23,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 04:31:23,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117295510] [2023-12-16 04:31:23,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:31:23,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 04:31:23,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:31:23,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 04:31:23,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:31:23,688 INFO L87 Difference]: Start difference. First operand 125 states and 178 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:31:23,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:31:23,994 INFO L93 Difference]: Finished difference Result 258 states and 369 transitions. [2023-12-16 04:31:23,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:31:23,994 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2023-12-16 04:31:23,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:31:23,996 INFO L225 Difference]: With dead ends: 258 [2023-12-16 04:31:23,996 INFO L226 Difference]: Without dead ends: 134 [2023-12-16 04:31:23,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-12-16 04:31:23,998 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 135 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:31:23,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 259 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:31:23,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-12-16 04:31:24,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 127. [2023-12-16 04:31:24,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 110 states have (on average 1.3727272727272728) internal successors, (151), 110 states have internal predecessors, (151), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:31:24,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 181 transitions. [2023-12-16 04:31:24,009 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 181 transitions. Word has length 120 [2023-12-16 04:31:24,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:31:24,010 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 181 transitions. [2023-12-16 04:31:24,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:31:24,010 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 181 transitions. [2023-12-16 04:31:24,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-16 04:31:24,011 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:31:24,011 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:31:24,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 04:31:24,011 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:31:24,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:31:24,011 INFO L85 PathProgramCache]: Analyzing trace with hash -506603339, now seen corresponding path program 1 times [2023-12-16 04:31:24,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:31:24,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806107283] [2023-12-16 04:31:24,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:31:24,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:31:24,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:24,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:31:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:24,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:31:24,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:24,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:31:24,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:24,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:31:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:24,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:31:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:24,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:31:24,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:24,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:31:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:24,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:31:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:24,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:31:24,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:24,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:31:24,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:24,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:31:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:24,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:31:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:24,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:31:24,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:24,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:31:24,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:24,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:31:24,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:24,405 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:31:24,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:31:24,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806107283] [2023-12-16 04:31:24,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806107283] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:31:24,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:31:24,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 04:31:24,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710893507] [2023-12-16 04:31:24,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:31:24,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 04:31:24,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:31:24,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 04:31:24,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:31:24,406 INFO L87 Difference]: Start difference. First operand 127 states and 181 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:31:24,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:31:24,646 INFO L93 Difference]: Finished difference Result 332 states and 470 transitions. [2023-12-16 04:31:24,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:31:24,647 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2023-12-16 04:31:24,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:31:24,648 INFO L225 Difference]: With dead ends: 332 [2023-12-16 04:31:24,648 INFO L226 Difference]: Without dead ends: 206 [2023-12-16 04:31:24,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:31:24,649 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 336 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:31:24,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 393 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:31:24,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2023-12-16 04:31:24,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 126. [2023-12-16 04:31:24,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 109 states have (on average 1.3761467889908257) internal successors, (150), 109 states have internal predecessors, (150), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:31:24,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 180 transitions. [2023-12-16 04:31:24,657 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 180 transitions. Word has length 120 [2023-12-16 04:31:24,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:31:24,657 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 180 transitions. [2023-12-16 04:31:24,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:31:24,657 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 180 transitions. [2023-12-16 04:31:24,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-16 04:31:24,658 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:31:24,658 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:31:24,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 04:31:24,658 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:31:24,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:31:24,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1982925623, now seen corresponding path program 1 times [2023-12-16 04:31:24,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:31:24,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495097512] [2023-12-16 04:31:24,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:31:24,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:31:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:24,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:31:24,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:24,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:31:24,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:24,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:31:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:24,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:31:24,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:24,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:31:24,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:24,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:31:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:24,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:31:24,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:24,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:31:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:24,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:31:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:24,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:31:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:24,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:31:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:24,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:31:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:24,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:31:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:24,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:31:24,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:24,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:31:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:24,902 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:31:24,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:31:24,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495097512] [2023-12-16 04:31:24,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495097512] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:31:24,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:31:24,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:31:24,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092138248] [2023-12-16 04:31:24,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:31:24,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:31:24,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:31:24,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:31:24,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:31:24,903 INFO L87 Difference]: Start difference. First operand 126 states and 180 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:31:25,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:31:25,013 INFO L93 Difference]: Finished difference Result 252 states and 360 transitions. [2023-12-16 04:31:25,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:31:25,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2023-12-16 04:31:25,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:31:25,014 INFO L225 Difference]: With dead ends: 252 [2023-12-16 04:31:25,014 INFO L226 Difference]: Without dead ends: 127 [2023-12-16 04:31:25,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:31:25,015 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 11 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:31:25,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 401 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:31:25,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-12-16 04:31:25,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 122. [2023-12-16 04:31:25,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 105 states have (on average 1.361904761904762) internal successors, (143), 105 states have internal predecessors, (143), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:31:25,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 173 transitions. [2023-12-16 04:31:25,023 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 173 transitions. Word has length 120 [2023-12-16 04:31:25,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:31:25,023 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 173 transitions. [2023-12-16 04:31:25,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:31:25,023 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 173 transitions. [2023-12-16 04:31:25,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-16 04:31:25,024 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:31:25,024 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:31:25,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-16 04:31:25,024 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:31:25,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:31:25,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1190525301, now seen corresponding path program 1 times [2023-12-16 04:31:25,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:31:25,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413807777] [2023-12-16 04:31:25,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:31:25,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:31:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:31:25,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:31:25,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:31:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:31:25,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:31:25,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:31:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:31:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:31:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:31:25,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:31:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:31:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:31:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:31:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:31:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:31:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:25,537 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:31:25,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:31:25,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413807777] [2023-12-16 04:31:25,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413807777] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:31:25,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:31:25,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 04:31:25,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635444845] [2023-12-16 04:31:25,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:31:25,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 04:31:25,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:31:25,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 04:31:25,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:31:25,542 INFO L87 Difference]: Start difference. First operand 122 states and 173 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 04:31:25,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:31:25,813 INFO L93 Difference]: Finished difference Result 312 states and 439 transitions. [2023-12-16 04:31:25,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:31:25,814 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 121 [2023-12-16 04:31:25,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:31:25,815 INFO L225 Difference]: With dead ends: 312 [2023-12-16 04:31:25,815 INFO L226 Difference]: Without dead ends: 191 [2023-12-16 04:31:25,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2023-12-16 04:31:25,816 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 348 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:31:25,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 292 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:31:25,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-12-16 04:31:25,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 124. [2023-12-16 04:31:25,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 107 states have (on average 1.3644859813084111) internal successors, (146), 107 states have internal predecessors, (146), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:31:25,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 176 transitions. [2023-12-16 04:31:25,828 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 176 transitions. Word has length 121 [2023-12-16 04:31:25,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:31:25,828 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 176 transitions. [2023-12-16 04:31:25,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 04:31:25,829 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 176 transitions. [2023-12-16 04:31:25,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-16 04:31:25,829 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:31:25,829 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:31:25,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-16 04:31:25,830 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:31:25,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:31:25,830 INFO L85 PathProgramCache]: Analyzing trace with hash -325010765, now seen corresponding path program 1 times [2023-12-16 04:31:25,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:31:25,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944396008] [2023-12-16 04:31:25,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:31:25,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:31:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:26,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:31:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:26,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:31:26,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:26,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:31:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:26,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:31:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:26,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:31:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:26,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:31:26,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:26,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:31:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:26,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:31:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:26,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:31:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:26,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:31:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:26,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:31:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:26,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:31:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:26,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:31:26,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:26,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:31:26,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:26,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:31:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:26,587 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:31:26,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:31:26,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944396008] [2023-12-16 04:31:26,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944396008] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:31:26,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:31:26,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 04:31:26,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442449755] [2023-12-16 04:31:26,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:31:26,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 04:31:26,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:31:26,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 04:31:26,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:31:26,590 INFO L87 Difference]: Start difference. First operand 124 states and 176 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:31:27,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:31:27,084 INFO L93 Difference]: Finished difference Result 420 states and 590 transitions. [2023-12-16 04:31:27,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:31:27,085 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2023-12-16 04:31:27,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:31:27,086 INFO L225 Difference]: With dead ends: 420 [2023-12-16 04:31:27,086 INFO L226 Difference]: Without dead ends: 297 [2023-12-16 04:31:27,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-12-16 04:31:27,087 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 443 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 04:31:27,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 431 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 04:31:27,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2023-12-16 04:31:27,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 146. [2023-12-16 04:31:27,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 129 states have (on average 1.372093023255814) internal successors, (177), 129 states have internal predecessors, (177), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:31:27,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 207 transitions. [2023-12-16 04:31:27,098 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 207 transitions. Word has length 121 [2023-12-16 04:31:27,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:31:27,098 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 207 transitions. [2023-12-16 04:31:27,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:31:27,099 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 207 transitions. [2023-12-16 04:31:27,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-16 04:31:27,099 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:31:27,099 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:31:27,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-16 04:31:27,099 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:31:27,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:31:27,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1913358667, now seen corresponding path program 1 times [2023-12-16 04:31:27,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:31:27,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861208961] [2023-12-16 04:31:27,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:31:27,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:31:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:27,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:31:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:27,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:31:27,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:27,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:31:27,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:27,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:31:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:27,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:31:27,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:27,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:31:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:27,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:31:27,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:27,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:31:27,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:27,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:31:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:27,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:31:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:27,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:31:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:27,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:31:27,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:27,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:31:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:27,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:31:27,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:27,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:31:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:27,822 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:31:27,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:31:27,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861208961] [2023-12-16 04:31:27,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861208961] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:31:27,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:31:27,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 04:31:27,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719324841] [2023-12-16 04:31:27,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:31:27,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 04:31:27,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:31:27,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 04:31:27,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:31:27,823 INFO L87 Difference]: Start difference. First operand 146 states and 207 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:31:28,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:31:28,279 INFO L93 Difference]: Finished difference Result 417 states and 585 transitions. [2023-12-16 04:31:28,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:31:28,279 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2023-12-16 04:31:28,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:31:28,280 INFO L225 Difference]: With dead ends: 417 [2023-12-16 04:31:28,280 INFO L226 Difference]: Without dead ends: 272 [2023-12-16 04:31:28,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-16 04:31:28,281 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 428 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:31:28,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 398 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:31:28,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2023-12-16 04:31:28,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 149. [2023-12-16 04:31:28,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 132 states have (on average 1.378787878787879) internal successors, (182), 132 states have internal predecessors, (182), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:31:28,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 212 transitions. [2023-12-16 04:31:28,311 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 212 transitions. Word has length 121 [2023-12-16 04:31:28,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:31:28,312 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 212 transitions. [2023-12-16 04:31:28,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:31:28,312 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 212 transitions. [2023-12-16 04:31:28,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-16 04:31:28,312 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:31:28,313 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:31:28,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-16 04:31:28,313 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:31:28,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:31:28,313 INFO L85 PathProgramCache]: Analyzing trace with hash -387050379, now seen corresponding path program 1 times [2023-12-16 04:31:28,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:31:28,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349317536] [2023-12-16 04:31:28,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:31:28,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:31:28,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:28,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:31:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:28,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:31:28,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:28,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:31:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:28,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:31:28,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:28,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:31:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:28,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:31:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:28,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:31:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:28,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:31:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:28,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:31:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:28,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:31:28,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:28,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:31:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:28,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:31:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:28,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:31:28,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:28,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:31:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:28,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:31:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:28,653 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:31:28,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:31:28,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349317536] [2023-12-16 04:31:28,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349317536] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:31:28,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:31:28,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 04:31:28,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85466029] [2023-12-16 04:31:28,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:31:28,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 04:31:28,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:31:28,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 04:31:28,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:31:28,655 INFO L87 Difference]: Start difference. First operand 149 states and 212 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 04:31:28,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:31:28,968 INFO L93 Difference]: Finished difference Result 395 states and 557 transitions. [2023-12-16 04:31:28,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:31:28,969 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 121 [2023-12-16 04:31:28,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:31:28,969 INFO L225 Difference]: With dead ends: 395 [2023-12-16 04:31:28,969 INFO L226 Difference]: Without dead ends: 247 [2023-12-16 04:31:28,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-12-16 04:31:28,970 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 316 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:31:28,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 280 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:31:28,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2023-12-16 04:31:28,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 153. [2023-12-16 04:31:28,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 136 states have (on average 1.3676470588235294) internal successors, (186), 136 states have internal predecessors, (186), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:31:28,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 216 transitions. [2023-12-16 04:31:28,978 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 216 transitions. Word has length 121 [2023-12-16 04:31:28,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:31:28,978 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 216 transitions. [2023-12-16 04:31:28,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 04:31:28,978 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 216 transitions. [2023-12-16 04:31:28,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-16 04:31:28,979 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:31:28,979 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:31:28,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-16 04:31:28,979 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:31:28,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:31:28,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1975398281, now seen corresponding path program 1 times [2023-12-16 04:31:28,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:31:28,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240422866] [2023-12-16 04:31:28,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:31:28,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:31:29,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:29,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:31:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:29,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:31:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:29,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:31:29,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:29,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:31:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:29,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:31:29,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:29,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:31:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:29,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:31:29,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:29,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:31:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:29,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:31:29,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:29,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:31:29,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:29,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:31:29,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:29,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:31:29,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:29,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:31:29,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:29,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:31:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:29,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:31:29,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:29,142 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:31:29,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:31:29,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240422866] [2023-12-16 04:31:29,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240422866] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:31:29,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:31:29,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:31:29,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021471720] [2023-12-16 04:31:29,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:31:29,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:31:29,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:31:29,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:31:29,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:31:29,144 INFO L87 Difference]: Start difference. First operand 153 states and 216 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:31:29,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:31:29,266 INFO L93 Difference]: Finished difference Result 394 states and 551 transitions. [2023-12-16 04:31:29,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:31:29,266 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2023-12-16 04:31:29,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:31:29,267 INFO L225 Difference]: With dead ends: 394 [2023-12-16 04:31:29,267 INFO L226 Difference]: Without dead ends: 242 [2023-12-16 04:31:29,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:31:29,268 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 205 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:31:29,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 330 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:31:29,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2023-12-16 04:31:29,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 129. [2023-12-16 04:31:29,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 112 states have (on average 1.3482142857142858) internal successors, (151), 112 states have internal predecessors, (151), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:31:29,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 181 transitions. [2023-12-16 04:31:29,275 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 181 transitions. Word has length 121 [2023-12-16 04:31:29,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:31:29,275 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 181 transitions. [2023-12-16 04:31:29,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-16 04:31:29,276 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 181 transitions. [2023-12-16 04:31:29,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-16 04:31:29,276 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:31:29,276 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:31:29,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-16 04:31:29,277 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:31:29,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:31:29,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1935488018, now seen corresponding path program 1 times [2023-12-16 04:31:29,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:31:29,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012874273] [2023-12-16 04:31:29,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:31:29,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:31:29,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:30,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:31:30,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:30,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:31:30,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:30,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:31:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:30,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:31:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:30,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:31:30,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:30,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:31:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:30,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:31:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:30,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:31:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:30,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:31:30,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:30,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:31:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:30,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:31:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:30,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:31:30,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:30,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:31:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:30,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:31:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:30,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:31:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:30,135 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:31:30,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:31:30,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012874273] [2023-12-16 04:31:30,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012874273] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:31:30,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:31:30,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 04:31:30,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834930072] [2023-12-16 04:31:30,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:31:30,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 04:31:30,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:31:30,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 04:31:30,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:31:30,136 INFO L87 Difference]: Start difference. First operand 129 states and 181 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 04:31:30,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:31:30,721 INFO L93 Difference]: Finished difference Result 438 states and 609 transitions. [2023-12-16 04:31:30,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 04:31:30,722 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 122 [2023-12-16 04:31:30,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:31:30,723 INFO L225 Difference]: With dead ends: 438 [2023-12-16 04:31:30,723 INFO L226 Difference]: Without dead ends: 310 [2023-12-16 04:31:30,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2023-12-16 04:31:30,723 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 448 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 04:31:30,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 431 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 04:31:30,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2023-12-16 04:31:30,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 145. [2023-12-16 04:31:30,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 128 states have (on average 1.3671875) internal successors, (175), 128 states have internal predecessors, (175), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 04:31:30,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 205 transitions. [2023-12-16 04:31:30,733 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 205 transitions. Word has length 122 [2023-12-16 04:31:30,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:31:30,733 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 205 transitions. [2023-12-16 04:31:30,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 04:31:30,733 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 205 transitions. [2023-12-16 04:31:30,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-16 04:31:30,735 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:31:30,735 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:31:30,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-16 04:31:30,735 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:31:30,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:31:30,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1493964742, now seen corresponding path program 1 times [2023-12-16 04:31:30,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:31:30,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470605929] [2023-12-16 04:31:30,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:31:30,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:31:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:31,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:31:31,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:31,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:31:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:31,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:31:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:31,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:31:31,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:31,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:31:31,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:31,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:31:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:31,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:31:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:31,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:31:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:31,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:31:31,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:31,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:31:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:31,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:31:31,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:31,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:31:31,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:31,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:31:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:31,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:31:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:31,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 04:31:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:31,468 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 36 proven. 6 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-16 04:31:31,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:31:31,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470605929] [2023-12-16 04:31:31,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470605929] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:31:31,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833230817] [2023-12-16 04:31:31,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:31:31,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:31:31,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:31:31,471 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:31:31,472 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:31:31,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:31,704 INFO L262 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 53 conjunts are in the unsatisfiable core [2023-12-16 04:31:31,714 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:31:33,999 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:31:34,532 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 25 treesize of output 13 [2023-12-16 04:31:34,798 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 21 treesize of output 20 [2023-12-16 04:31:34,906 INFO L349 Elim1Store]: treesize reduction 86, result has 28.9 percent of original size [2023-12-16 04:31:34,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 68 treesize of output 104 [2023-12-16 04:31:34,959 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 0 case distinctions, treesize of input 31 treesize of output 20 [2023-12-16 04:31:35,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:35,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:35,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:35,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:35,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:35,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:35,197 INFO L349 Elim1Store]: treesize reduction 400, result has 18.5 percent of original size [2023-12-16 04:31:35,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 307 treesize of output 431 [2023-12-16 04:31:36,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:36,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:36,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:36,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:36,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:36,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:36,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:36,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:36,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:36,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:36,735 INFO L349 Elim1Store]: treesize reduction 163, result has 18.1 percent of original size [2023-12-16 04:31:36,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 838 treesize of output 845 [2023-12-16 04:31:38,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:38,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:38,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:38,791 INFO L349 Elim1Store]: treesize reduction 36, result has 18.2 percent of original size [2023-12-16 04:31:38,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 802 treesize of output 775 [2023-12-16 04:31:39,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:39,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:39,374 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:39,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 379 treesize of output 572 [2023-12-16 04:31:39,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-16 04:31:39,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-16 04:31:39,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-16 04:31:39,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-16 04:31:39,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-16 04:31:39,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-16 04:31:40,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-16 04:31:40,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-16 04:31:40,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-16 04:31:40,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-16 04:31:40,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-16 04:31:40,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-16 04:31:40,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:40,500 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:40,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:40,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:40,504 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:40,504 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:40,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 56 treesize of output 48 [2023-12-16 04:31:40,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:40,537 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:40,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:40,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:40,541 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:40,544 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:40,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 56 treesize of output 42 [2023-12-16 04:31:40,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:40,582 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:40,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:40,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:40,587 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:40,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 38 treesize of output 17 [2023-12-16 04:31:40,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:40,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:40,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:40,967 INFO L349 Elim1Store]: treesize reduction 117, result has 28.2 percent of original size [2023-12-16 04:31:40,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 7 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 639 treesize of output 1089 [2023-12-16 04:31:41,545 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-16 04:31:41,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:41,679 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:41,770 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:41,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:42,020 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:42,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:42,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:42,224 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:42,268 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:42,301 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:42,326 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:42,342 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:42,348 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:42,349 INFO L224 Elim1Store]: Index analysis took 129 ms [2023-12-16 04:31:42,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 6 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 122 treesize of output 328 [2023-12-16 04:31:42,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:42,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:42,468 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:42,498 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:42,524 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:42,556 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:42,573 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:42,573 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:42,574 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:42,574 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:42,574 INFO L224 Elim1Store]: Index analysis took 110 ms [2023-12-16 04:31:42,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 6 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 122 treesize of output 328 [2023-12-16 04:31:42,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:42,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:42,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:42,914 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:42,918 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:42,924 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:42,938 INFO L224 Elim1Store]: Index analysis took 249 ms [2023-12-16 04:31:42,987 INFO L349 Elim1Store]: treesize reduction 64, result has 1.5 percent of original size [2023-12-16 04:31:42,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 6 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 122 treesize of output 328 [2023-12-16 04:31:43,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:43,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:43,102 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:43,166 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:43,191 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:43,192 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:43,223 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:43,249 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:43,264 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:43,264 INFO L224 Elim1Store]: Index analysis took 175 ms [2023-12-16 04:31:43,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 6 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 122 treesize of output 328 [2023-12-16 04:31:43,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:43,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:43,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:43,532 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:43,581 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:43,764 INFO L224 Elim1Store]: Index analysis took 245 ms [2023-12-16 04:31:43,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 6 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 328 [2023-12-16 04:31:43,930 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:44,029 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:44,167 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-16 04:31:44,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:44,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:44,799 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:44,837 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:44,918 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-16 04:31:44,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:45,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:45,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:45,715 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:45,737 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:45,807 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:45,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:45,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:46,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:46,096 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-16 04:31:46,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:46,210 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-16 04:31:46,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:46,250 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:46,306 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:46,326 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:46,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:46,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:46,975 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:46,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:46,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:46,980 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:46,980 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:46,981 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:46,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 59 treesize of output 51 [2023-12-16 04:31:47,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:47,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:47,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:47,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:47,021 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-12-16 04:31:47,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 78 [2023-12-16 04:31:47,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:47,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:47,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:47,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2023-12-16 04:31:47,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:47,117 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:47,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:47,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:47,139 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:47,139 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:47,140 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:47,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 59 treesize of output 51 [2023-12-16 04:31:47,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:47,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:47,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:47,357 INFO L349 Elim1Store]: treesize reduction 112, result has 27.7 percent of original size [2023-12-16 04:31:47,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 7 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 9 new quantified variables, introduced 14 case distinctions, treesize of input 630 treesize of output 1079 [2023-12-16 04:31:48,008 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:48,110 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-16 04:31:48,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:48,214 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:48,298 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:48,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:49,101 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:49,212 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:49,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:49,386 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:49,502 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-16 04:31:49,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:49,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:49,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:49,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:49,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:49,881 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:49,945 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-16 04:31:49,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:49,994 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:50,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:50,243 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-16 04:31:50,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:50,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:50,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:50,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:50,937 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:50,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:51,052 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:51,133 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-16 04:31:51,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:52,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:52,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:52,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:52,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 227 treesize of output 237 [2023-12-16 04:31:52,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:52,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:52,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:52,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:52,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:52,253 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-12-16 04:31:52,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 84 [2023-12-16 04:31:52,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:52,292 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:52,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:52,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:52,296 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:52,297 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:52,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 62 treesize of output 54 [2023-12-16 04:31:52,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:52,335 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:52,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:52,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:52,340 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:52,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 44 treesize of output 23 [2023-12-16 04:31:52,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:52,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:52,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:52,683 INFO L349 Elim1Store]: treesize reduction 101, result has 27.9 percent of original size [2023-12-16 04:31:52,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 6 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 13 case distinctions, treesize of input 534 treesize of output 851 [2023-12-16 04:31:53,819 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:53,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:53,996 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:54,074 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:54,182 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:55,048 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:55,115 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-16 04:31:55,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:55,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:55,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:55,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:55,726 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-16 04:31:55,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:55,831 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:55,875 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:55,924 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:55,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:56,004 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:56,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:56,161 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:56,186 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:56,250 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:56,325 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-16 04:31:56,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:56,353 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:56,767 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:56,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:56,860 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:56,873 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:56,949 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:56,993 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-16 04:31:56,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 16 [2023-12-16 04:31:57,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:57,349 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:57,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:57,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:57,353 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:57,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 41 treesize of output 20 [2023-12-16 04:31:57,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:57,358 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:57,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:57,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:57,361 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:57,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 41 treesize of output 20 [2023-12-16 04:31:57,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:57,405 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:57,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:57,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:57,411 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:57,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 41 treesize of output 20 [2023-12-16 04:31:57,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:57,433 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:57,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:57,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:57,437 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:57,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 41 treesize of output 20 [2023-12-16 04:31:57,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:57,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:57,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:57,462 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:57,462 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:57,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 36 [2023-12-16 04:31:57,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:57,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:57,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:57,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:57,505 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-12-16 04:31:57,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 35 [2023-12-16 04:31:57,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:57,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:57,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:57,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:57,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:57,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:57,904 INFO L349 Elim1Store]: treesize reduction 601, result has 12.4 percent of original size [2023-12-16 04:31:57,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 17 case distinctions, treesize of input 252 treesize of output 412 [2023-12-16 04:31:58,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:58,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:58,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:58,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:58,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:58,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:58,152 INFO L349 Elim1Store]: treesize reduction 89, result has 16.0 percent of original size [2023-12-16 04:31:58,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 96 treesize of output 139 [2023-12-16 04:31:58,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:58,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:58,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:58,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:58,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:58,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:58,273 INFO L349 Elim1Store]: treesize reduction 89, result has 16.0 percent of original size [2023-12-16 04:31:58,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 96 treesize of output 139 [2023-12-16 04:31:58,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:58,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:58,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:58,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:58,359 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:58,360 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:58,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:58,361 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:58,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 118 [2023-12-16 04:31:58,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:58,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:58,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:58,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:58,449 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:58,450 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:58,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:58,451 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:58,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 118 [2023-12-16 04:31:58,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:58,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:58,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:58,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:58,522 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:58,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:58,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:58,530 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:58,532 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:58,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 118 [2023-12-16 04:31:58,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:58,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:58,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:58,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:58,725 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:58,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:58,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 04:31:58,736 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:58,738 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 04:31:58,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 118 Received shutdown request... [2023-12-16 04:32:16,543 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 04:32:16,551 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:32:16,564 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:32:16,565 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 04:32:16,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-16 04:32:16,745 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 123 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-6-1 term,while PolyPacSimplificationTermWalker was simplifying 6 xjuncts wrt. a ∧-15-1 context. [2023-12-16 04:32:16,749 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:32:16,751 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 04:32:16,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:32:16 BoogieIcfgContainer [2023-12-16 04:32:16,758 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 04:32:16,758 INFO L158 Benchmark]: Toolchain (without parser) took 58469.73ms. Allocated memory was 260.0MB in the beginning and 890.2MB in the end (delta: 630.2MB). Free memory was 215.7MB in the beginning and 602.4MB in the end (delta: -386.7MB). Peak memory consumption was 538.7MB. Max. memory is 8.0GB. [2023-12-16 04:32:16,758 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 192.9MB. Free memory is still 143.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:32:16,759 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.91ms. Allocated memory is still 260.0MB. Free memory was 215.2MB in the beginning and 199.8MB in the end (delta: 15.4MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-16 04:32:16,759 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.26ms. Allocated memory is still 260.0MB. Free memory was 199.8MB in the beginning and 196.3MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 04:32:16,759 INFO L158 Benchmark]: Boogie Preprocessor took 81.87ms. Allocated memory is still 260.0MB. Free memory was 196.3MB in the beginning and 192.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-16 04:32:16,759 INFO L158 Benchmark]: RCFGBuilder took 544.67ms. Allocated memory is still 260.0MB. Free memory was 191.6MB in the beginning and 160.1MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2023-12-16 04:32:16,760 INFO L158 Benchmark]: TraceAbstraction took 57543.24ms. Allocated memory was 260.0MB in the beginning and 890.2MB in the end (delta: 630.2MB). Free memory was 159.6MB in the beginning and 602.4MB in the end (delta: -442.8MB). Peak memory consumption was 483.2MB. Max. memory is 8.0GB. [2023-12-16 04:32:16,761 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.49ms. Allocated memory is still 192.9MB. Free memory is still 143.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 250.91ms. Allocated memory is still 260.0MB. Free memory was 215.2MB in the beginning and 199.8MB in the end (delta: 15.4MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.26ms. Allocated memory is still 260.0MB. Free memory was 199.8MB in the beginning and 196.3MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 81.87ms. Allocated memory is still 260.0MB. Free memory was 196.3MB in the beginning and 192.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 544.67ms. Allocated memory is still 260.0MB. Free memory was 191.6MB in the beginning and 160.1MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 57543.24ms. Allocated memory was 260.0MB in the beginning and 890.2MB in the end (delta: 630.2MB). Free memory was 159.6MB in the beginning and 602.4MB in the end (delta: -442.8MB). Peak memory consumption was 483.2MB. 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: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was analyzing trace of length 123 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-6-1 term,while PolyPacSimplificationTermWalker was simplifying 6 xjuncts wrt. a ∧-15-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 57.5s, OverallIterations: 18, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3400 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3400 mSDsluCounter, 5765 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3726 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4387 IncrementalHoareTripleChecker+Invalid, 4465 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 2039 mSDtfsCounter, 4387 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 670 GetRequests, 555 SyntacticMatches, 3 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153occurred in iteration=15, InterpolantAutomatonStates: 106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 1062 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 2040 NumberOfCodeBlocks, 2040 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2023 ConstructedInterpolants, 0 QuantifiedInterpolants, 10098 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 7140/7140 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